On the public citation graph
Bounds for Generalized Thrackles
0 signed · 84 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4612-0963-8openalex-snapshot
Unsolved problems in geometry: unsolved problems in intuitive mathematics
inferredcites →https://doi.org/10.1016/0012-365x(92)00484-9openalex-snapshot
Subthrackleable graphs and four cycles
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jctb.2000.1978openalex-snapshot
Which Crossing Number Is It Anyway?
inferred← citeshttps://doi.org/10.1007/11618058_25openalex-snapshot
On Edges Crossing Few Other Edges in Simple Topological Complete Graphs
inferred← citeshttps://doi.org/10.1007/11618058_30openalex-snapshot
Crossing Number of Toroidal Graphs
inferred← citeshttps://doi.org/10.1007/3-540-33700-8_28openalex-snapshot
Crossing Number of Toroidal Graphs
inferred← citeshttps://doi.org/10.1007/3-540-36136-7_57openalex-snapshot
Monotone Drawings of Planar Graphs
inferred← citeshttps://doi.org/10.1007/3-540-44541-2_31openalex-snapshot
Unavoidable Configurations in Complete Topological Graphs
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_14openalex-snapshot
Hanani–Tutte, Monotone Drawings, and Level-Planarity
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-12340-0_15openalex-snapshot
Towards the Hanani-Tutte Theorem for Clustered Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-27261-0_6openalex-snapshot
The Degenerate Crossing Number and Higher-Genus Embeddings
inferred← citeshttps://doi.org/10.1007/978-3-319-27261-0_9openalex-snapshot
Hanani-Tutte for Radial Planarity
inferred← citeshttps://doi.org/10.1007/978-3-319-44543-4_3openalex-snapshot
Bounded Embeddings of Graphs in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_35openalex-snapshot
A Direct Proof of the Strong Hanani–Tutte Theorem on the Projective Plane
inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_36openalex-snapshot
Hanani-Tutte for Radial Planarity II
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-540-24595-7_55openalex-snapshot
Selected Open Problems in Graph Drawing
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-642-18469-7_21openalex-snapshot
A Computational Approach to Conway’s Thrackle Conjecture
inferred← citeshttps://doi.org/10.1007/978-3-642-25870-1_26openalex-snapshot
Hanani-Tutte and Monotone Drawings
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_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_36openalex-snapshot
Clustered Planarity Testing Revisited
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/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/s00454-022-00412-wopenalex-snapshot
The $$\mathbb {Z}_2$$-Genus of Kuratowski Minors
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.1007/s00493-019-3905-7openalex-snapshot
Counterexample to an Extension of the Hanani-Tutte Theorem on the Surface of Genus 4
inferred← citeshttps://doi.org/10.1016/j.aim.2010.06.021openalex-snapshot
On the optimality of the Arf invariant formula for graph polynomials
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.comgeo.2014.02.003openalex-snapshot
On grids in topological graphs
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.2008.03.005openalex-snapshot
On edges crossing few other edges in simple topological complete graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2015.06.023openalex-snapshot
Great-circle spherical 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.endm.2007.07.015openalex-snapshot
Removing Even Crossings on Surfaces
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.1137/08072485xopenalex-snapshot
Strong Hanani–Tutte on the Projective Plane
inferred← citeshttps://doi.org/10.1137/12088104xopenalex-snapshot
Density Theorems for Intersection Graphs of $t$-Monotone Curves
inferred← citeshttps://doi.org/10.1145/1542362.1542430openalex-snapshot
On grids in topological graphs
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.4230/lipics.socg.2019.39openalex-snapshot
Z_2-Genus of Graphs and Minimum Rank of Partial Symmetric Matrices
inferred← citeshttps://doi.org/10.48550/arxiv.1608.07855openalex-snapshot
A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane
inferred← citeshttps://doi.org/10.48550/arxiv.1702.05358openalex-snapshot
Computational topology of graphs on surfaces
inferred← citeshttps://doi.org/10.5075/epfl-thesis-5334openalex-snapshot
Intersection Patterns of Edges in Topological Graphs
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.