Thrackles: an improved upper bound

DOI10.1016/J.DAM.2018.12.025MaRDI QIDQ1735700zbMATH OpenOpenAlexFDO

Authors 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

2-dimensional surfacedischarging methodgraph embeddingparity embeddingprojective planethrackle

Mathematics Subject Classification ID

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

Recommendations

• Thrackles: an improved upper bound
• Bounds for generalized thrackles
• On Conway's thrackle conjecture
• A new upper bound for Conway's thrackles
• COMPUTATIONAL GEOMETRY COLUMN 26

Cites work

• A computational approach to Conway's thrackle conjecture
• Bounds for generalized thrackles
• Disjoint edges in topological graphs and the tangled-thrackle conjecture
• Generalized thrackle drawings of non-bipartite graphs
• scientific article; zbMATH DE number 3339161 (Why is no real title available?)
• scientific article; zbMATH DE number 3104192 (Why is no real title available?)
• On Conway's thrackle conjecture
• On the bounds of Conway's thrackles

Cited in

(15)

• Subthrackleable graphs and four-cycles
• Bounds for generalized thrackles
• Great-circle tree thrackles
• On the edge-vertex ratio of maximal thrackles
• A new upper bound for Conway's thrackles
• Superthrackles
• Thrackles: an improved upper bound
• scientific article; zbMATH DE number 876705 (Why is no real title available?)
• Thrackles, superthrackles and the Hanani-Tutte theorem
• Convex hull thrackles
• A structure theorem for pseudo-segments and its applications
• A structure theorem for pseudosegments and its applications
• Tangling and untangling trees on point-sets
• Separable drawings: extendability and crossing-free Hamiltonian cycles
• Unavoidable patterns and plane paths in dense topological graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1735700)