Erdős–Szekeres Theorem for Lines-Reference-Cited by-同舟云学术

Erdős–Szekeres Theorem for Lines

Published:2015-06-09 Issue:3 Volume:54 Page:669-685
ISSN:0179-5376
Container-title:Discrete & Computational Geometry
language:en
Short-container-title:Discrete Comput Geom

Author:

Bárány Imre,Roldán-Pensado Edgardo,Tóth Géza

Funder

OTKA

European Research Council

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00454-015-9705-y.pdf

Reference28 articles.

1. Avis, D., Hosono, K., Urabe, M.: On the existence of a point subset with a specified number of interior points. Discrete Math. 241(1), 33–40 (2001)

2. Bárány, I., Károlyi, G.: Problems and results around the Erdős–Szekeres convex polygon theorem. In: Akiyama, J., Kano, M., Urabe, M. (eds.) Discrete and Computational Geometry (Tokyo, 2000). Lecture Notes in Computer Science, vol. 2098, pp. 91–105. Springer, Berlin (2001)

3. Bárány, I., Pach, J.: Homogeneous selections from hyperplanes. J. Comb. Theory Ser. B 104, 81–87 (2014)

4. Bárány, I., Valtr, P.: A positive fraction Erdős–Szekeres theorem. Discrete Comput. Geom. 19, 335–342 (1998)

5. Christ, T.: Discrete descriptions of geometric objects. Ph.D. Thesis, ETH Zurich Institute for Theoretical Computer Science. http://e-collection.library.ethz.ch/view/eth:5242 (2011)

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Erdős–Szekeres Theorem for k-Flats;Discrete & Computational Geometry;2022-10-31

2. The unavoidable arrangements of pseudocircles;Proceedings of the American Mathematical Society;2019-03-26

3. Ramsey Theory;2018-08-06