On the public citation graph
The crossing number of K 11 is 100
0 signed · 56 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/s10107-006-0039-7openalex-snapshot
Reduction of symmetric semidefinite programs using the regular $$\ast$$ -representation
inferredcites →https://doi.org/10.1016/0095-8956(76)90032-0openalex-snapshot
A note on the parity of the number of crossings of a graph
inferredcites →https://doi.org/10.1080/00029890.1997.11990611openalex-snapshot
Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs
inferredcites →https://doi.org/10.37236/1567openalex-snapshot
The Rectilinear Crossing Number of $K_{10}$ is $62$
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.21908openalex-snapshot
On the Crossing Number of Kn without Computer Assistance
inferred← citeshttps://doi.org/10.1002/jgt.22665openalex-snapshot
Drawings of complete graphs in the projective plane
inferred← citeshttps://doi.org/10.1002/jgt.22763openalex-snapshot
Bounding the tripartite‐circle crossing number of complete tripartite graphs
inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_2openalex-snapshot
The Rectilinear Crossing Number of K n : Closing in (or Are We?)
inferred← citeshttps://doi.org/10.1007/978-3-319-00200-2_12openalex-snapshot
Expected Crossing Numbers
inferred← citeshttps://doi.org/10.1007/978-3-319-31940-7_13openalex-snapshot
Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill
inferred← citeshttps://doi.org/10.1007/978-3-319-94667-2_23openalex-snapshot
The Crossing Number of Seq-Shellable Drawings of Complete Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-03456-5_21openalex-snapshot
The Crossing Number of Graphs: Theory and Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-25462-8_40openalex-snapshot
On the Crossing Number of Generalized Fat Trees
inferred← citeshttps://doi.org/10.1007/s00283-009-9120-4openalex-snapshot
The Early History of the Brick Factory Problem
inferred← citeshttps://doi.org/10.1007/s00373-015-1550-5openalex-snapshot
Empty Triangles in Good Drawings of the Complete Graph
inferred← citeshttps://doi.org/10.1007/s00453-019-00653-xopenalex-snapshot
Crossing Number for Graphs with Bounded Pathwidth
inferred← citeshttps://doi.org/10.1007/s00454-014-9635-0openalex-snapshot
Shellable Drawings and the Cylindrical Crossing Number of $$K_{n}$$ K n
inferred← citeshttps://doi.org/10.1007/s00454-014-9644-zopenalex-snapshot
Crossing Numbers and Combinatorial Characterization of Monotone Drawings of $$K_n$$ K n
inferred← citeshttps://doi.org/10.1007/s10114-022-2310-0openalex-snapshot
A Contribution to Guy’s Conjecture
inferred← citeshttps://doi.org/10.1016/j.amc.2020.125075openalex-snapshot
The crossing number of K5,n+1∖e
inferred← citeshttps://doi.org/10.1016/j.dam.2018.03.070openalex-snapshot
The crossing number of locally twisted cubes LTQn
inferred← citeshttps://doi.org/10.1016/j.dam.2026.09.023openalex-snapshot
K6-subdivisions in optimal 1-planar graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.11.023openalex-snapshot
The crossing number of K1,m,n
inferred← citeshttps://doi.org/10.1016/j.disc.2014.03.011openalex-snapshot
The crossing number of the Cartesian product of paths with complete graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2017.01.022openalex-snapshot
K7 -minors in optimal 1 -planar graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2008.06.015openalex-snapshot
Recent Advances in Exact Crossing Minimization (Extended Abstract)
inferred← citeshttps://doi.org/10.1016/j.jctb.2015.06.002openalex-snapshot
On the crossing number of K13
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.03.031openalex-snapshot
Fan-crossing free graphs and their relationship to other beyond-planar graphs
inferred← citeshttps://doi.org/10.1080/00207160.2012.726711openalex-snapshot
An upper bound for the crossing number of augmented cubes
inferred← citeshttps://doi.org/10.1080/1726037x.2021.1909219openalex-snapshot
On Numerical Invariant of Graph
inferred← citeshttps://doi.org/10.1137/09076965xopenalex-snapshot
Facets in the Crossing Number Polytope
inferred← citeshttps://doi.org/10.1137/110852206openalex-snapshot
Improved Lower Bounds for the 2-Page Crossing Numbers of $K_{m,n}$ and $K_n$ via Semidefinite Programming
inferred← citeshttps://doi.org/10.1137/120886777openalex-snapshot
Improved Lower Bounds on Book Crossing Numbers of Complete Graphs
inferred← citeshttps://doi.org/10.1142/s0218216518430101openalex-snapshot
A note on the cross-index of a complete graph based on a linear tree
inferred← citeshttps://doi.org/10.1145/1993636.1993678openalex-snapshot
An algorithm for the graph crossing number problem
inferred← citeshttps://doi.org/10.1155/2009/154015openalex-snapshot
An Evolutionary Formulation of the Crossing Number Problem
inferred← citeshttps://doi.org/10.12677/aam.2023.123116openalex-snapshot
The Crossing Number of Double Generalized Petersen Graph DP(7,1)
inferred← citeshttps://doi.org/10.12677/pm.2023.1310304openalex-snapshot
The Crossing Number of Rose Windows Graph R(3k, 3, 2)
inferred← citeshttps://doi.org/10.12677/pm.2023.1310319openalex-snapshot
The Crossing Number of a Class of Small-Order Graphs
inferred← citeshttps://doi.org/10.1515/comp-2015-0004openalex-snapshot
Various heuristic algorithms to minimise the two-page crossing numbers of graphs
inferred← citeshttps://doi.org/10.15673/tmgc.v11i2.1026openalex-snapshot
On measures of nonplanarity of cubic graphs
inferred← citeshttps://doi.org/10.37236/2713openalex-snapshot
The Graph Crossing Number and its Variants: A Survey
inferred← citeshttps://doi.org/10.4169/000298910x480117openalex-snapshot
A Parity Theorem for Drawings of Complete and Complete Bipartite Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1103.4227openalex-snapshot
The crossing number of locally twisted cubes
inferred← citeshttps://doi.org/10.48550/arxiv.1211.4642openalex-snapshot
The crossing number of pancake graph $P_4$ is six
inferred← citeshttps://doi.org/10.48550/arxiv.1901.05155openalex-snapshot
A survey of graphs with known or bounded crossing numbers
inferred← citeshttps://doi.org/10.48550/arxiv.1907.06245openalex-snapshot
A new bound for the crossing number of wrapped butterflies
inferred← citeshttps://doi.org/10.7155/jgaa.00487openalex-snapshot
An effective crossing minimisation heuristic based on star insertion
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.