Disjoint edges in topological graphs and the tangled-thrackle conjecture

DOI10.1016/j.ejc.2015.07.004zbMath1321.05099OpenAlexW2554500686WikidataQ123310123 ScholiaQ123310123MaRDI QIDQ499492

Csaba D. Tóth, Andrew Suk, Andres J. Ruiz-Vargas

Publication date: 30 September 2015

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2015.07.004

zbMATH Keywords

Conway conjecture

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Unavoidable patterns in complete simple topological graphs ⋮ On the edge-vertex ratio of maximal thrackles ⋮ Thrackles: an improved upper bound

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A computational approach to Conway's thrackle conjecture
• On Conway's thrackle conjecture
• Density Theorems for Intersection Graphs of $t$-Monotone Curves
• Conway’s Conjecture for Monotone Thrackles
• Research Problems in Discrete Geometry
• Improved bounds and new techniques for Davenport--Schinzel sequences and their generalizations
• Tangled Thrackles
• Topological graphs
• Sharp bounds on Davenport-Schinzel sequences of every order
• Combinatorial Geometry and Graph Theory
• Disjoint edges in complete topological graphs

This page was built for publication: Disjoint edges in topological graphs and the tangled-thrackle conjecture