A computational approach to Conway's thrackle conjecture

DOI10.1016/j.comgeo.2011.02.001zbMath1232.05143arXiv1002.3904OpenAlexW1490386853WikidataQ123266378 ScholiaQ123266378MaRDI QIDQ551503

János Pach, Radoslav Fulek

Publication date: 20 July 2011

Published in: Computational Geometry (Search for Journal in Brave)

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

zbMATH Keywords

planar graphsConway's thrackle conjectureplanarity testingsimple topological graphsTurán-type questions

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

On Reay's relaxed Tverberg conjecture and generalizations of Conway's thrackle conjecture, A new upper bound for Conway's thrackles, On the bounds of Conway's thrackles, On the edge-vertex ratio of maximal thrackles, Thrackles: an improved upper bound, Tangled Thrackles, Disjoint edges in topological graphs and the tangled-thrackle conjecture, Unnamed Item, Thrackles containing a standard musquash, Great-circle spherical thrackles, The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg, Great-circle tree thrackles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized thrackle drawings of non-bipartite graphs
• Generalized thrackles and geometric graphs in \({\mathbb{R}}^3\) with no pair of strongly avoiding edges
• Subthrackleable graphs and four-cycles
• On Conway's thrackle conjecture
• Bounds for generalized thrackles
• Research Problems in Discrete Geometry
• Efficient Planarity Testing
• TRÉMAUX TREES AND PLANARITY