A computational approach to Conway's thrackle conjecture

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 >= 3. For any epsilon > 0, we give an algorithm terminating in e(O)((1/epsilon(2))ln(1/epsilon)) steps to decide whether t(n) <= (1 + epsilon)n for all n >= 3. Using this approach, we improve the best known upper bound, t(n) 3.(n 1), due to Cairns and Nikolayevsky, to 167/117n< 10428n. (C) 2011 Elsevier B.V. All rights reserved.


Published in:
Computational Geometry: Theory and Applications, 44, 6-7, 345-355
Year:
2011
Keywords:
Laboratories:


Note: The status of this file is: EPFL only


 Record created 2011-02-21, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)