On the existence of a convex point subset containing one triangle in the plane

DOI10.1016/j.disc.2005.07.006zbMath1087.52007OpenAlexW2028119184MaRDI QIDQ2581413

Kiyoshi Hosono

Publication date: 10 January 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.07.006

zbMATH Keywords

combinatorial convexitycontainment problemthe Erdős-Szekeres theorem

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Erd?s problems and related topics of discrete geometry (52C10) Convex sets in (2) dimensions (including convex curves) (52A10) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items (3)

On the existence of a point subset with three or five interior points ⋮ Every large point set contains many collinear points or an empty pentagon ⋮ More on an Erdős-Szekeres-type problem for interior points

Cites Work

• Unnamed Item
• Unnamed Item
• Finding sets of points without empty convex 6-gons
• Sets with No Empty Convex 7-Gons
• On the existence of a point subset with a specified number of interior points

This page was built for publication: On the existence of a convex point subset containing one triangle in the plane