Crossing and intersecting families of geometric graphs on point sets

DOI10.1007/s00373-023-02734-9arXiv2211.09904OpenAlexW4391188057WikidataQ129319723 ScholiaQ129319723MaRDI QIDQ6154369

Nestaly Marín, Jorge Cravioto-Lagos, J. L. Álvarez-Rebollar, Oriol Solé-Pi, Jorge Urrutia

Publication date: 15 February 2024

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2211.09904

zbMATH Keywords

geometric graphsintersecting familiescrossing familiesself-crossing graphs

Mathematics Subject Classification ID

Discrete geometry (52Cxx) Graph theory (05Cxx) Computer science (68-XX) Computing methodologies and applications (68Uxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Advances in the theory and practice of graph drawing
• Crossing families
• A positive fraction Erdős-Szekeres theorem
• On Hamiltonian alternating cycles and paths
• The partitioned version of the Erdős-Szekeres theorem
• Planar point sets determine many pairwise crossing segments
• On crossing-families in planar point sets
• On crossing families of complete geometric graphs
• Crossing patterns of semi-algebraic sets
• A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing
• A seperation property of plane convex sets.
• ALTERNATING HAMILTON CYCLES WITH MINIMUM NUMBER OF CROSSINGS IN THE PLANE
• Matching colored points in the plane: Some new results

This page was built for publication: Crossing and intersecting families of geometric graphs on point sets