Empty convex polygons in almost convex sets
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F07%3A00101458" target="_blank" >RIV/00216208:11320/07:00101458 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Empty convex polygons in almost convex sets
Original language description
A finite set of points, in general position in the plane, is almost convex if every triple determines a triangle with at most one point in its interior. For every -; [.gt.] 3, we determine the maximum size of an almost convex set that does not contain the vertex set of an empty convex ;-gon.
Czech name
Prázdné konvexní mnohoúhelníky v téměř konvexních množinách
Czech description
Určujeme maximální velikost téměř konvexní množiny bez l bodů tvořících vrcholy konvexního mnohoúhelníka.
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/1M0545" target="_blank" >1M0545: Institute for Theoretical Computer Science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2007
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Periodica Mathematica Hungarica
ISSN
0031-5303
e-ISSN
—
Volume of the periodical
55
Issue of the periodical within the volume
2
Country of publishing house
HU - HUNGARY
Number of pages
7
Pages from-to
—
UT code for WoS article
000261840700001
EID of the result in the Scopus database
—