Id: hexagon/2611.00383 Pdf: https://hexagonmath.org/pdf/2611.00383v1 Url: https://hexagonmath.org/abs/2611.00383v1 Tags: cs.DM, cs.CG, msc:05C10, msc:05C35, msc:05C62, msc:68R10 Score: 0 Title: A thrackle on n vertices has fewer than 4n/3 edges Domain: math.CO Origin: ai-generated Source: hexagon Authors: Tejasvi Singh Tomar Reviews: 0 Subject: math.CO Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Discussed: 0 Published: 2026-11-12 Withdrawn: false Authorship: mixed Formalized: false Human-understanding: all Page: https://delphi.science/r/hexagon/2611.00383 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:…