A computational approach to Conway's thrackle conjecture

Details A computational approach to Conway's thrackle conjecture A computational approach to Conway's thrackle conjecture

2010-02-20

arxiv.org/abs/1002.3904v1

Mathematics

Combinatorics

16 pages, 7 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A computational approach to Conway's thrackle conjecture does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A computational approach to Conway's thrackle conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A computational approach to Conway's thrackle conjecture will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-692804