Year: 2016
Type: preprint
Abstract: A thrackle is a drawing of a graph in which each pair of edges meets precisely once. Conway's Thrackle Conjecture asserts that a planar thrackle drawing of a graph cannot have more edges than vertices, which is equivalent to saying that no connected component of the graph contains more than one cycle. We prove that a thrackle drawing containing a standard musquash (standard $n$-gonal thrackle) cannot contain any other cycle of length three or five.
Source: arXiv (Cornell University)
Authors: Misereh, Grace, Nikolayevsky, Yuri
Institution: La Trobe University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2268074237