Crossing families
From MaRDI portal
Publication:1330788
DOI10.1007/BF01215345zbMath0804.52010WikidataQ59701047 ScholiaQ59701047MaRDI QIDQ1330788
Wayne Goddard, János Pach, Daniel J. Kleitman, Boris Aronov, Leonard J. Schulman, Paul Erdős, Michael Klugerman
Publication date: 11 August 1994
Published in: Combinatorica (Search for Journal in Brave)
68W10: Parallel algorithms in computer science
52C10: Erd?s problems and related topics of discrete geometry
Related Items
Matching colored points in the plane: Some new results, Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane, Erdős-Szekeres theorem for point sets with forbidden subconfigurations, A lower bound on the number of triangulations of planar point sets, Lines, line-point incidences and crossing families in dense sets, Partitions of complete geometric graphs into plane trees, Crossing patterns of semi-algebraic sets
Cites Work