On the public citation graph

On Conway's Thrackle Conjecture

https://doi.org/10.1007/pl00009322
0 signed · 83 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/jgt.3190010105openalex-snapshot
A note of welcome
inferredcites →https://doi.org/10.1007/bf00147522openalex-snapshot
A combinatorial problem
inferredcites →https://doi.org/10.1007/bf02579761openalex-snapshot
Jahresbericht der Deutschen Mathematikervereinigung
inferredcites →https://doi.org/10.1007/bfb0067363openalex-snapshot
Crossing numbers of graphs
inferredcites →https://doi.org/10.1016/0097-3165(75)90004-7openalex-snapshot
The largest small hexagon
inferredcites →https://doi.org/10.1016/0925-7721(94)00014-xopenalex-snapshot
Algorithms for drawing graphs: an annotated bibliography
inferredcites →https://doi.org/10.1016/s0021-9800(70)80007-2openalex-snapshot
Toward a theory of crossing numbers
inferredcites →https://doi.org/10.1137/0604033openalex-snapshot
Crossing Number is NP-Complete
inferredcites →https://doi.org/10.1201/9780203490204.ch7openalex-snapshot
Topological Graph Theory
inferredcites →https://doi.org/10.1201/b12336-17openalex-snapshot
Linear Algebra Methods in Combinatorics
inferredcites →https://doi.org/10.4064/cm-3-1-50-57openalex-snapshot
On a problem of K. Zarankiewicz
inferredcites →https://doi.org/10.4153/cmb-1969-059-3openalex-snapshot
On Subsets with Intersections of Even Cardinality
inferredcites →https://doi.org/10.5860/choice.33-5161openalex-snapshot
Combinatorial geometry

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/rsa.20344openalex-snapshot
Dependent random choice
inferred← citeshttps://doi.org/10.1006/jctb.2000.1978openalex-snapshot
Which Crossing Number Is It Anyway?
inferred← citeshttps://doi.org/10.1007/3-540-44541-2_31openalex-snapshot
Unavoidable Configurations in Complete Topological Graphs
inferred← citeshttps://doi.org/10.1007/3-540-47738-1_28openalex-snapshot
On the complexity of the union of geometric objects
inferred← citeshttps://doi.org/10.1007/978-1-4419-7910-0_1openalex-snapshot
Fair-Division Problems
inferred← citeshttps://doi.org/10.1007/978-1-4419-7910-0_2openalex-snapshot
Graph-Coloring Problems
inferred← citeshttps://doi.org/10.1007/978-1-4419-7910-0_3openalex-snapshot
Evasiveness of Graph Properties
inferred← citeshttps://doi.org/10.1007/978-1-4419-7910-0_4openalex-snapshot
Embedding and Mapping Problems
inferred← citeshttps://doi.org/10.1007/978-1-4419-7910-0_5openalex-snapshot
Appendix A: Basic Concepts from Graph Theory
inferred← citeshttps://doi.org/10.1007/978-1-4419-7910-0_6openalex-snapshot
Appendix B: Crash Course in Topology
inferred← citeshttps://doi.org/10.1007/978-1-4419-7910-0_7openalex-snapshot
Appendix C: Partially Ordered Sets, Order Complexes, and Their Topology
inferred← citeshttps://doi.org/10.1007/978-1-4419-7910-0_8openalex-snapshot
Appendix D: Groups and Group Actions
inferred← citeshttps://doi.org/10.1007/978-1-4419-7910-0_9openalex-snapshot
Appendix E: Some Results and Applications from Smith Theory
inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_15openalex-snapshot
On Disjoint Crossing Families in Geometric Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-35802-0_37openalex-snapshot
On the Edge-Vertex Ratio of Maximal Thrackles
inferred← citeshttps://doi.org/10.1007/978-3-319-73915-1_14openalex-snapshot
Thrackles: An Improved Upper Bound
inferred← citeshttps://doi.org/10.1007/978-3-319-78825-8_6openalex-snapshot
On the Maximum Crossing Number
inferred← citeshttps://doi.org/10.1007/978-3-540-32439-3_12openalex-snapshot
Relaxing Planarity for Topological Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-44400-8_24openalex-snapshot
Relaxing Planarity for Topological Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-45078-8_12openalex-snapshot
Extremal Configurations and Levels in Pseudoline Arrangements
inferred← citeshttps://doi.org/10.1007/978-3-540-72914-3_1openalex-snapshot
On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features
inferred← citeshttps://doi.org/10.1007/978-3-540-85221-6openalex-snapshot
Building Bridges
inferred← citeshttps://doi.org/10.1007/978-3-642-18469-7_21openalex-snapshot
A Computational Approach to Conway’s Thrackle Conjecture
inferred← citeshttps://doi.org/10.1007/978-3-642-34191-5_4openalex-snapshot
Tangled Thrackles
inferred← citeshttps://doi.org/10.1007/978-3-642-34191-5_7openalex-snapshot
The Chromatic Number of the Convex Segment Disjointness Graph
inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_31openalex-snapshot
Tangles and Degenerate Tangles
inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_32openalex-snapshot
Density Theorems for Intersection Graphs of t-Monotone Curves
inferred← citeshttps://doi.org/10.1007/978-3-642-39286-3_17openalex-snapshot
The Beginnings of Geometric Graph Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-41498-5_10openalex-snapshot
Hanani-Tutte and Related Results
inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_24openalex-snapshot
Disjoint Edges in Topological Graphs and the Tangled-Thrackle Conjecture
inferred← citeshttps://doi.org/10.1007/pl00009424openalex-snapshot
On the Boundary of the Union of Planar Convex Sets
inferred← citeshttps://doi.org/10.1007/pl00009495openalex-snapshot
Bounds for Generalized Thrackles
inferred← citeshttps://doi.org/10.1007/s00224-008-9115-0openalex-snapshot
On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features
inferred← citeshttps://doi.org/10.1007/s00373-008-0796-6openalex-snapshot
Generalized Thrackles and Geometric Graphs in $${\mathbb{R}}^3$$ with No Pair of Strongly Avoiding Edges
inferred← citeshttps://doi.org/10.1007/s00373-010-1010-1openalex-snapshot
Outerplanar Thrackles
inferred← citeshttps://doi.org/10.1007/s00373-015-1610-xopenalex-snapshot
Geometric Achromatic and Pseudoachromatic Indices
inferred← citeshttps://doi.org/10.1007/s00454-003-0012-9openalex-snapshot
Unavoidable Configurations in Complete Topological Graphs
inferred← citeshttps://doi.org/10.1007/s00454-008-9095-5openalex-snapshot
Generalized Thrackle Drawings of Non-bipartite Graphs
inferred← citeshttps://doi.org/10.1007/s00454-017-9877-8openalex-snapshot
On the Bounds of Conway’s Thrackles
inferred← citeshttps://doi.org/10.1007/s00493-008-2150-2openalex-snapshot
Pfaffian graphs, T-joins and crossing numbers
inferred← citeshttps://doi.org/10.1007/s00493-008-2250-zopenalex-snapshot
Geometric graphs with no two parallel edges
inferred← citeshttps://doi.org/10.1007/s00493-009-2475-5openalex-snapshot
Density theorems for bipartite graphs and related Ramsey-type results
inferred← citeshttps://doi.org/10.1016/j.amc.2020.125573openalex-snapshot
A New Upper Bound for Conway’s Thrackles
inferred← citeshttps://doi.org/10.1016/j.comgeo.2011.02.001openalex-snapshot
A computational approach to Conwayʼs thrackle conjecture
inferred← citeshttps://doi.org/10.1016/j.dam.2018.12.025openalex-snapshot
Thrackles: An improved upper bound
inferred← citeshttps://doi.org/10.1016/j.disc.2015.06.023openalex-snapshot
Great-circle spherical thrackles
inferred← citeshttps://doi.org/10.1016/j.disc.2022.113121openalex-snapshot
Great-circle tree thrackles
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114840openalex-snapshot
Convex hull thrackles
inferred← citeshttps://doi.org/10.1016/j.ejc.2009.03.002openalex-snapshot
Removing even crossings on surfaces
inferred← citeshttps://doi.org/10.1016/j.ejc.2015.07.004openalex-snapshot
Disjoint edges in topological graphs and the tangled-thrackle conjecture
inferred← citeshttps://doi.org/10.1016/j.endm.2007.07.015openalex-snapshot
Removing Even Crossings on Surfaces
inferred← citeshttps://doi.org/10.1016/j.endm.2011.09.060openalex-snapshot
On disjoint crossing families in geometric graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2025.04.007openalex-snapshot
A structure theorem for pseudosegments and its applications
inferred← citeshttps://doi.org/10.1016/s0012-365x(99)00130-2openalex-snapshot
The answer to Woodall's musquash problem
inferred← citeshttps://doi.org/10.1017/s0963548303005984openalex-snapshot
Selecting Points that are Heavily Covered by Pseudo-Circles, Spheres or Rectangles
inferred← citeshttps://doi.org/10.1090/conm/453/08794openalex-snapshot
State of the union (of geometric objects)
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743512openalex-snapshot
Which crossing number is it, anyway? [computational geometry]
inferred← citeshttps://doi.org/10.1137/12088104xopenalex-snapshot
Density Theorems for Intersection Graphs of $t$-Monotone Curves
inferred← citeshttps://doi.org/10.1145/513400.513417openalex-snapshot
Lenses in arrangements of pseudo-circles and their applications
inferred← citeshttps://doi.org/10.1145/972639.972641openalex-snapshot
Lenses in arrangements of pseudo-circles and their applications
inferred← citeshttps://doi.org/10.23638/dmtcs-20-1-16openalex-snapshot
Annular and pants thrackles
inferred← citeshttps://doi.org/10.26181/22225540openalex-snapshot
The Thrackle Conjecture for K5 and K33
inferred← citeshttps://doi.org/10.4169/amer.math.monthly.118.06.544openalex-snapshot
Conway’s Conjecture for Monotone Thrackles
inferred← citeshttps://doi.org/10.48550/arxiv.1703.06526openalex-snapshot
On Optimal 2- and 3-Planar Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1804.01057openalex-snapshot
The exact chromatic number of the convex segment disjointness graph
inferred← citeshttps://doi.org/10.48550/arxiv.1808.00385openalex-snapshot
A Note on the Maximum Rectilinear Crossing Number of Spiders
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0108021openalex-snapshot
Computational Geometry Column 42
inferred← citeshttps://doi.org/10.5075/epfl-thesis-5334openalex-snapshot
Intersection Patterns of Edges in Topological Graphs
inferred← citeshttps://doi.org/10.7155/jgaa.00458openalex-snapshot
On the Maximum Crossing Number
inferred← citeshttps://doi.org/10.7155/jgaa.v28i1.2930openalex-snapshot
Thrackles, Superthrackles and the Hanani-Tutte Theorem
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.