On Conway's thrackle conjecture
type: Item
instance of: scholarly article
title: On Conway's thrackle conjecture
zbMATH Open document ID: 0892.05017
DOI: 10.1007/PL00009322
published in: Discrete \& Computational Geometry
publication date: 1998-03-11T00:00:00Z
review text: A thrackle is a graph drawn in the plane with its edges represented by Jordan arcs so that any two distinct arcs either meet at exactly one common vertex or cross at exactly one point interior to both arcs. J. H. Conway's thrackle conjecture is that the number of edges of a thrackle is at most the number of its vertices. The present authors show that every thrackleable bipartite graph is planar, and use this result to show that a thrackle having \(n\) vertices has at most \(2n-3\) edges. They also consider some related problems and generalizations.
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 1127620
zbMATH Keywords: Jordan arcs
zbMATH Keywords: Conway's thrackle conjecture
zbMATH Keywords: planar
Wikidata QID: Q102219488
author: János Pach
author: László Lovász
author: Mario Szegedy
reviewed by: Arthur T. White
MaRDI profile type: Publication
full work available at URL: pl00009322
OpenAlex ID: W2049848809
DBLP publication ID: journals/dcg/LovaszPS97
Recommended article: On a conjecture of Conway
Recommended article: On the bounds of Conway's thrackles
Recommended article: A computational approach to Conway's thrackle conjecture
Recommended article: A Computational Approach to Conway’s Thrackle Conjecture
Recommended article: On Thompson's conjecture
Recommended article: Conway’s Conjecture for Monotone Thrackles
Recommended article: On the Thomassen's conjecture
Recommended article: Q4486822
Recommended article: On a conjecture of Thompson
description: scientific article; zbMATH DE number 1127620