Unavoidable patterns in complete simple topological graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 434700 (Why is no real title available?)
- scientific article; zbMATH DE number 2080111 (Why is no real title available?)
- A combinatorial problem in geometry.
- A decomposition theorem for partially ordered sets
- Combinatorial Geometry and Graph Theory
- Disjoint edges in complete topological graphs
- Disjoint edges in topological graphs and the tangled-thrackle conjecture
- Erdős-Szekeres-type theorems for monotone paths and convex bodies
- Improved enumeration of simple topological graphs
- Many disjoint edges in topological graphs
- Note on geometric graphs
- On edges crossing few other edges in simple topological complete graphs
- On the Erdős-Szekeres convex polygon problem
- Research Problems in Discrete Geometry
- The probabilistic method
- Topological graphs, empty triangles and disjoint matchings
- Twisted ways to find plane structures in simple drawings of complete graphs
- Unavoidable configurations in complete topological 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)