Crossing families
From MaRDI portal
Publication:1330788
DOI10.1007/BF01215345zbMath0804.52010OpenAlexW4237276646WikidataQ59701047 ScholiaQ59701047MaRDI QIDQ1330788
János Pach, Daniel J. Kleitman, Wayne Goddard, Paul Erdős, Boris Aronov, Michael Klugerman, Leonard J. Schulman
Publication date: 11 August 1994
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01215345
Parallel algorithms in computer science (68W10) Erd?s problems and related topics of discrete geometry (52C10)
Related Items
A lower bound on the number of triangulations of planar point sets, Packing plane spanning trees and paths in complete geometric graphs, On crossing-families in planar point sets, Order on order types, Lines, line-point incidences and crossing families in dense sets, Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane, Crossing and intersecting families of geometric graphs on point sets, A center transversal theorem for hyperplanes and applications to graph drawing, A positive fraction Erdős-Szekeres theorem and its applications, On geometric graphs on point sets in the plane, Packing plane spanning trees into a point set, Erdős-Szekeres theorem for point sets with forbidden subconfigurations, On the geometric Ramsey numbers of trees, On the geometric Ramsey number of outerplanar graphs, Partitions of complete geometric graphs into plane trees, Matching colored points in the plane: Some new results, Perfect matchings with crossings, On grids in point-line arrangements in the plane, Unnamed Item, A positive fraction mutually avoiding sets theorem, Planar point sets determine many pairwise crossing segments, A Ramsey-type result for geometric \(\ell\)-hypergraphs, The maximum number of edges in geometric graphs with pairwise virtually avoiding edges, On Grids in Point-Line Arrangements in the Plane, Clustering analysis of a dissimilarity: a review of algebraic and geometric representation, Crossing patterns of semi-algebraic sets
Cites Work
