Disjoint edges in geometric graphs

DOI10.1007/BF02187731zbMath0692.05037OpenAlexW2118113811WikidataQ59701087 ScholiaQ59701087MaRDI QIDQ5893809

Noga Alon, Paul Erdős

Publication date: 1989

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131080

zbMATH Keywords

configurationcombinatorial geometrythree pairwise disjoint line segments

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (11)

Crossing families ⋮ Some geometric applications of Dilworth's theorem ⋮ Intersection number of two connected geometric graphs ⋮ Applications of the crossing number ⋮ Note on geometric graphs ⋮ On convex geometric graphs with no \(k+1\) pairwise disjoint edges ⋮ Noncrossing monochromatic subtrees and staircases in 0-1 matrices ⋮ Disjoint edges in geometric graphs ⋮ A Turán-type theorem on chords of a convex polygon ⋮ Unnamed Item ⋮ Crossing numbers of beyond-planar graphs

Cites Work

• On Sets of Distances of n Points
• Unnamed Item
• Unnamed Item

This page was built for publication: Disjoint edges in geometric graphs