Forcing disjoint segments in the plane

European Journal of Combinatorics

Volumn 17, Issue 4, 1996, Pages 391-395

  Goddard, Wayne ^a   Katchalski, Meir ^b   Kleitman, Daniel J ^c  

^a UNIVERSITY OF KWAZULU NATAL   (South Africa)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21344474071     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1006/eujc.1996.0032     Document Type: Article

References (10)

1. J. Akiyama and N. Alon, Disjoint simplices and geometric hypergraphs, Ann. N.Y. Acad. Sci., 555 (1989), 1-3.
2. N. Alon and P. Erdos, Disjoint edges in geometric graphs, Discr. Comput. Geom., 4 (1989), 287-290,
3. S. Avital and H. Hanani, Graphs, Gilyonot Lematematika, 3 (1966), 2-8 (in Hebrew).
4. V. Capoyleas and J. Pach, A Turán-type theorem on chords of a convex polyhedron, J. Combin. Theory, Ser. B, 56 (1992), 9-15.
5. P. Erdos, On sets of distances of n points, Amer. Math. Monthly, 53 (1946), 248-250.
6. Y. S. Kupitz, Extremal Problems in Combinatorial Geometry, Aarhus University Lecture Notes Series, No. 53, Aarhus University, Denmark, 1979.
7. Y. S. Kupitz, On pairs of disjoint segments in convex position in the plane, Ann. Discr. Math., 20 (1984), 203-208.
8. W. Moser and J. Pach, Recent developments in combinatorial geometry, in: New Trends in Discrete and Combinatorial Geometry, J. Pach (ed.), Springer-Verlag, Berlin, 1993, Chapter 11, pp. 281-302.
9. P. O'Donnel and M. Perles, Every geometric graph with n vertices and 3.6n + 3.4 edges contains 3 pairwise disjoint edges, Manuscript, 1991.
10. J. Pach and J. Törocsik, Some geometric applications of Dilworth's theorem, Discr. Comput. Geom., 12 (1994), 1-7.