Unavoidable patterns in complete simple topological graphs

DOI10.1007/S00454-024-00658-6MaRDI QIDQ6662767

Andrew Suk, Ji Zeng

Publication date: 14 January 2025

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

zbMATH Keywords

topological graphunavoidable patternsplane path

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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 combinatorial problem in geometry.
• A decomposition theorem for partially ordered sets
• The probabilistic method
• 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
• Twisted ways to find plane structures in simple drawings of complete graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6662767)