Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference6 articles.
1. N. Alon, M. Katchalski, and W. R. Pulleyblank: The maximum size of a convex polygon in a restricted set of points in the plane,Discrete Comput. Geom. 4 (1989), 245–251.
2. P. Erdős, G. Szekeres: A combinatorial problem in geometry,Compositio Math. 2 (1935), 464–470.
3. P. Erdős, G. Szekeres: On some extremum problems in elementary geometry,Ann. Univ. Sci. Budapest 3/4 (1960/61), 53–62.
4. H. Harborth: Konvexe Fünfecke in ebenen Punktmengen,Elem. Math. 33 (1978), 116–118.
5. J. D. Horton: Sets with no empty convex 7-gons,Canad. Math. Bull. 26 (1983), 482–484.
Cited by
37 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Erdős–Szekeres-Type Problems in the Real Projective Plane;Discrete & Computational Geometry;2024-09-09
2. Two-Sided Convexity Testing with Certificates;Studia Scientiarum Mathematicarum Hungarica;2024-07-24
3. No selection lemma for empty triangles;Acta Mathematica Hungarica;2024-05-23
4. Fixing a Hole;Discrete & Computational Geometry;2023-09-07
5. Empty rainbow triangles in k-colored point sets;Computational Geometry;2021-04