Unavoidable patterns in complete simple topological graphs

DOI10.1007/978-3-031-22203-0_1arXiv2204.04293OpenAlexW4317393955MaRDI QIDQ6117029

Andrew Suk, Ji Zeng

Publication date: 16 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

topological graphunavoidable patternsplane path

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (5)

Empty triangles in generalized twisted drawings of \(K_n\) ⋮ Shooting stars in simple drawings of \(K_{m,n}\) ⋮ Empty Triangles in Generalized Twisted Drawings of $K_n$ ⋮ Twisted ways to find plane structures in simple drawings of complete graphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved enumeration of simple topological graphs
• Disjoint edges in topological graphs and the tangled-thrackle conjecture
• New bounds on the maximum number of edges in \(k\)-quasi-planar graphs
• On edges crossing few other edges in simple topological complete graphs
• Unavoidable configurations in complete topological graphs
• Note on geometric graphs
• A decomposition theorem for partially ordered sets
• Erdős-Szekeres-type theorems for monotone paths and convex bodies
• Research Problems in Discrete Geometry
• Topological graphs
• On the Erdős-Szekeres convex polygon problem
• Combinatorial Geometry and Graph Theory
• Disjoint edges in complete topological graphs
• Many disjoint edges in topological graphs

This page was built for publication: Unavoidable patterns in complete simple topological graphs