A computational approach to Conway's thrackle conjecture

DOI10.1016/J.COMGEO.2011.02.001zbMATH Open1232.05143arXiv1002.3904OpenAlexW1490386853WikidataQ123266378 ScholiaQ123266378MaRDI QIDQ551503FDOQ551503

Authors: Radoslav Fulek, János Pach 

Publication date: 20 July 2011

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

Abstract: A drawing of a graph in the plane is called a thrackle if every pair of edges meets precisely once, either at a common vertex or at a proper crossing. Let t(n) denote the maximum number of edges that a thrackle of n vertices can have. According to a 40 years old conjecture of Conway, t(n)=n for every n>2. For any eps>0, we give an algorithm terminating in e^{O((1/eps^2)ln(1/eps))} steps to decide whether t(n)<(1+eps)n for all n>2. Using this approach, we improve the best known upper bound, t(n)<=3/2(n-1), due to Cairns and Nikolayevsky, to 167/117n<1.428n.

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

Recommendations

• A computational approach to Conway's thrackle conjecture
• COMPUTATIONAL GEOMETRY COLUMN 26
• On Conway's thrackle conjecture
• A new upper bound for Conway's thrackles
• On the bounds of Conway's thrackles

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)

Cites Work

• Title not available (Why is that?)
• Research Problems in Discrete Geometry
• Efficient Planarity Testing
• On Conway's thrackle conjecture
• Title not available (Why is that?)
• 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
• Bounds for generalized thrackles
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• TRÉMAUX TREES AND PLANARITY

Cited In (17)

• Conway's conjecture for monotone thrackles
• Tangled thrackles
• Great-circle spherical thrackles
• Thrackles: an improved upper bound
• On the bounds of Conway's thrackles
• A new upper bound for Conway's thrackles
• Thrackles, superthrackles and the Hanani-Tutte theorem
• On Reay's relaxed Tverberg conjecture and generalizations of Conway's thrackle conjecture
• On Conway's thrackle conjecture
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
• On disjoint crossing families in geometric graphs
• COMPUTATIONAL GEOMETRY COLUMN 26
• Thrackles containing a standard musquash
• Disjoint edges in topological graphs and the tangled-thrackle conjecture
• A computational approach to Conway's thrackle conjecture
• On the edge-vertex ratio of maximal thrackles
• Great-circle tree thrackles

This page was built for publication: A computational approach to Conway's thrackle conjecture

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