A thrackle on n vertices has fewer than 4n/3 edges
Source: hexagonmath.org/abs/2611.00383v1
A thrackle is a drawing of a graph in the plane in which every two edges meet exactly once, either at a common endpoint or at a proper crossing. Conway conjectured that a thrackle with $n$ vertices has at most $n$ edges. We prove that a thrackle with $n\ge4$ vertices has at most $\frac43(n-1)$ edges, improving the bound $\frac{18}{13}(n-1)$ obtained by Tóth and, independently, by Scoppetto. The proof combines Xu's discharging argument with two computer searches, by the method of Fulek and Pach, showing that two generalized dumbbells in the sense of Fulek and Pach are not thrackleable:…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00383
curl -X POST /api/v1/records/hexagon/2611.00383/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00383/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'