1 search results - page 1 / 1 » A computational approach to Conway's thrackle conjecture |
COMGEO
2011
ACM
12 years 11 months ago
2011
ACM
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 ...