On edges crossing few other edges in simple topological complete graphs

DOI10.1016/j.disc.2008.03.005zbMath1175.05042OpenAlexW2012800930MaRDI QIDQ1011770

Jan Kynčl, Pavel Valtr

Publication date: 9 April 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.03.005

zbMATH Keywords

crossingscomplete graphdrawings in the plane

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (6)

Unavoidable patterns in complete simple topological graphs ⋮ Empty Triangles in Generalized Twisted Drawings of $K_n$ ⋮ Twisted ways to find plane structures in simple drawings of complete graphs ⋮ Simple realizability of complete abstract topological graphs in P ⋮ Unnamed Item ⋮ Quantitative Restrictions on Crossing Patterns

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Geometric graphs with no three disjoint edges
• Edges without crossings in drawings of complete graphs
• Unavoidable configurations in complete topological graphs
• Bounds for generalized thrackles
• Research Problems in Discrete Geometry
• New lower bound techniques for VLSI
• Crossing-Free Subgraphs
• Combinatorial Geometry and Graph Theory
• Discrete and Computational Geometry

This page was built for publication: On edges crossing few other edges in simple topological complete graphs