Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Large empty convex polygons in \(k\)-convex sets

From MaRDI portal
Publication:1410439
Jump to:navigation, search

DOI10.1023/A:1025757808886zbMath1026.52016OpenAlexW1789265278MaRDI QIDQ1410439

Gábor Kun, Gabor Lippner

Publication date: 14 October 2003

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1025757808886


zbMATH Keywords

\(k\)-convex set of pointsempty convex \(n\)-gon


Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30)


Related Items (5)

Drawing the almost convex set in an integer grid of minimum size ⋮ On \(k\)-convex polygons ⋮ Every large point set contains many collinear points or an empty pentagon ⋮ A simple proof for open cups and caps ⋮ Constructions from empty polygons







This page was built for publication: Large empty convex polygons in \(k\)-convex sets

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1410439&oldid=13573966"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 16:42.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki