Disjoint edges in complete topological graphs

DOI10.1007/s00454-012-9481-xzbMath1260.05045OpenAlexW2015259717MaRDI QIDQ5917904

Andrew Suk

Publication date: 20 March 2013

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

Full work available at URL: https://doi.org/10.1007/s00454-012-9481-x

zbMATH Keywords

independent settopological graphsdisjoint edges

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (7)

Unavoidable patterns in complete simple topological graphs ⋮ Shooting stars in simple drawings of \(K_{m,n}\) ⋮ Many disjoint edges in topological graphs ⋮ Disjoint edges in topological graphs and the tangled-thrackle conjecture ⋮ On plane subgraphs of complete topological drawings ⋮ Saturated simple and \(k\)-simple topological graphs ⋮ Empty triangles in complete topological graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane
• Ramsey-type theorems
• Density theorems for bipartite graphs and related Ramsey-type results
• Optimal packing and covering in the plane are NP-complete
• Intersection graphs of curves in the plane
• Label placement by maximum independent set in rectangles
• Unavoidable configurations in complete topological graphs
• Quasi-optimal range searching in spaces of finite VC-dimension
• Research Problems in Discrete Geometry
• Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
• Approximation schemes for covering and packing problems in image processing and VLSI
• Combinatorial Geometry and Graph Theory
• Geometric discrepancy. An illustrated guide

This page was built for publication: Disjoint edges in complete topological graphs