On conway's thrackle conjecture

László Lovász, János Pach, Mario Szegedy

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations


A thrackle is a graph that can be drawn in the plane so that its edges are represented by Jordan arcs and any two distinct arcs either meet at exactly one common vertex or cross at exactly one point interior to both arcs. About thirty years ago, J. H. Conway conjectured that the number of edges of a thrackle cannot exceed the number of its vertices. We show that a thrackle has at most twice as many edges as vertices. Some related problems and generalizations are also considered.

Original languageEnglish (US)
Title of host publicationProceedings of the 11th Annual Symposium on Computational Geometry, SCG 1995
PublisherAssociation for Computing Machinery
Number of pages5
ISBN (Electronic)0897917243
StatePublished - Sep 1 1995
Externally publishedYes
Event11th Annual Symposium on Computational Geometry, SCG 1995 - Vancouver, Canada
Duration: Jun 5 1995Jun 7 1995

Publication series

NameProceedings of the Annual Symposium on Computational Geometry
VolumePart F129372


Other11th Annual Symposium on Computational Geometry, SCG 1995

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Geometry and Topology
  • Computational Mathematics


Dive into the research topics of 'On conway's thrackle conjecture'. Together they form a unique fingerprint.

Cite this