Loading...
research article
Conway's conjecture for monotone thrackles
A drawing of a graph in the plane is called a thrackle if every pair of edges meet precisely once, either at a common vertex or at a proper crossing. According to Conway's conjecture, every thrackle has at most as many edges as vertices. We prove this conjecture for x-monotone thrackles, that is, in the case when every edge meets every vertical line in at most one point.
Type
research article
Web of Science ID
WOS:000291233100006
Authors
Publication date
2011
Publisher
Published in
Volume
118
Start page
544
End page
548
Subjects
Peer reviewed
REVIEWED
EPFL units
Available on Infoscience
December 12, 2011
Use this identifier to reference this record