Another Brick in the Wall: A Computationally Assisted Proof of an Improved Upper Bound for Thrackles

Let $G$ be a thrackle, where a thrackle is a graph drawing in which each edge meets every other edge exactly once, either at a vertex or at a crossing. It is conjectured that, for all thrackles, the number of edges is less than or equal to the number of vertices. Fulek and Pach created a program to