Unavoidable patterns and plane paths in dense topological graphs
From MaRDI portal
Cites work
- A combinatorial problem in geometry.
- A computational approach to Conway's thrackle conjecture
- A new upper bound for Conway's thrackles
- Bounds for generalized thrackles
- Construction of locally plane graphs with many edges
- Convex hull thrackles
- Conway's conjecture for monotone thrackles
- Disjoint edges in complete topological graphs
- Disjoint edges in topological graphs
- Drawings of complete multipartite graphs up to triangle flips
- Geometric graphs with no self-intersecting path of length three
- scientific article; zbMATH DE number 46958 (Why is no real title available?)
- scientific article; zbMATH DE number 3339161 (Why is no real title available?)
- Many disjoint edges in topological graphs
- On a class of degenerate extremal graph problems
- On a problem of formal logic.
- On Conway's thrackle conjecture
- On Reay's relaxed Tverberg conjecture and generalizations of Conway's thrackle conjecture
- On the bounds of Conway's thrackles
- Outerplanar thrackles
- Ramsey-type theorems for spatial graphs and good drawings
- The number of edges in k-quasi-planar graphs
- Thrackles, superthrackles and the Hanani-Tutte theorem
- Thrackles: an improved upper bound
- Twisted ways to find plane structures in simple drawings of complete graphs
- Unavoidable configurations in complete topological graphs
- Unavoidable patterns in complete simple topological graphs
This page was built for publication: Unavoidable patterns and plane paths in dense topological graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7364475)
