On the Bounds of Conway’s Thrackles

Luis Goddyn; Yian Xu

doi:10.1007/s00454-017-9877-8

On the Bounds of Conway’s Thrackles

Luis Goddyn, Yian Xu

Research output: Contribution to journal › Article › peer-review

8 Citations (Scopus)

Abstract

A thrackle on a surfaceX is a graph of size e and order n drawn on X such that every two distinct edges of G meet exactly once either at their common endpoint, or at a proper crossing. An unsolved conjecture of Conway (1969) asserts that (Formula presented.) for every thrackle on a sphere. Until now, the best known bound is (Formula presented.). By using discharging rules we show that (Formula presented.).

Original language	English
Pages (from-to)	410-416
Number of pages	7
Journal	Discrete & Computational Geometry
Volume	58
Issue number	2
DOIs	https://doi.org/10.1007/s00454-017-9877-8
Publication status	Published - 1 Sept 2017

Access to Document

10.1007/s00454-017-9877-8

Cite this

@article{fb1c28fb95164bbba642fe5275ebe6bb,

title = "On the Bounds of Conway{\textquoteright}s Thrackles",

abstract = "A thrackle on a surfaceX is a graph of size e and order n drawn on X such that every two distinct edges of G meet exactly once either at their common endpoint, or at a proper crossing. An unsolved conjecture of Conway (1969) asserts that (Formula presented.) for every thrackle on a sphere. Until now, the best known bound is (Formula presented.). By using discharging rules we show that (Formula presented.).",

keywords = "Crossing number, Generalized thrackle, Thrackle",

author = "Luis Goddyn and Yian Xu",

year = "2017",

month = sep,

day = "1",

doi = "10.1007/s00454-017-9877-8",

language = "English",

volume = "58",

pages = "410--416",

journal = "Discrete & Computational Geometry",

issn = "0179-5376",

publisher = "Springer",

number = "2",

}

TY - JOUR

T1 - On the Bounds of Conway’s Thrackles

AU - Goddyn, Luis

AU - Xu, Yian

PY - 2017/9/1

Y1 - 2017/9/1

N2 - A thrackle on a surfaceX is a graph of size e and order n drawn on X such that every two distinct edges of G meet exactly once either at their common endpoint, or at a proper crossing. An unsolved conjecture of Conway (1969) asserts that (Formula presented.) for every thrackle on a sphere. Until now, the best known bound is (Formula presented.). By using discharging rules we show that (Formula presented.).

AB - A thrackle on a surfaceX is a graph of size e and order n drawn on X such that every two distinct edges of G meet exactly once either at their common endpoint, or at a proper crossing. An unsolved conjecture of Conway (1969) asserts that (Formula presented.) for every thrackle on a sphere. Until now, the best known bound is (Formula presented.). By using discharging rules we show that (Formula presented.).

KW - Crossing number

KW - Generalized thrackle

KW - Thrackle

UR - http://www.scopus.com/inward/record.url?scp=85014521818&partnerID=8YFLogxK

U2 - 10.1007/s00454-017-9877-8

DO - 10.1007/s00454-017-9877-8

M3 - Article

AN - SCOPUS:85014521818

SN - 0179-5376

VL - 58

SP - 410

EP - 416

JO - Discrete & Computational Geometry

JF - Discrete & Computational Geometry

IS - 2

ER -

On the Bounds of Conway’s Thrackles

Abstract

Access to Document

Other files and links

Fingerprint

Cite this