Thrackles: an improved upper bound

DOI10.1016/j.dam.2018.12.025zbMath1407.05162OpenAlexW2752631028MaRDI QIDQ1735700

Radoslav Fulek, János Pach

Publication date: 28 March 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://real.mtak.hu/102416/1/1708.08037

zbMATH Keywords

projective planegraph embeddingdischarging methodthrackleparity embedding2-dimensional surface

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (3)

A new upper bound for Conway's thrackles ⋮ On the edge-vertex ratio of maximal thrackles ⋮ Great-circle tree thrackles

Cites Work

• Unnamed Item
• Unnamed Item
• Disjoint edges in topological graphs and the tangled-thrackle conjecture
• A computational approach to Conway's thrackle conjecture
• Generalized thrackle drawings of non-bipartite graphs
• On Conway's thrackle conjecture
• Bounds for generalized thrackles
• On the bounds of Conway's thrackles

This page was built for publication: Thrackles: an improved upper bound