On the public citation graph

On the Crossing Number of $K_{m,n}$

https://doi.org/10.37236/1748
0 signed · 19 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.3190170602openalex-snapshot
Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
inferredcites →https://doi.org/10.1016/s0021-9800(70)80087-4openalex-snapshot
The crossing number of K
inferredcites →https://doi.org/10.1080/00029890.1997.11990611openalex-snapshot
Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs

What points at this work

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

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-540-70904-6_16openalex-snapshot
Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
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/s00373-020-02163-yopenalex-snapshot
Rectilinear Crossings in Complete Balanced d-Partite d-Uniform Hypergraphs
inferred← citeshttps://doi.org/10.1016/j.ejor.2011.04.026openalex-snapshot
Copositive optimization – Recent developments and applications
inferred← citeshttps://doi.org/10.1090/conm/795/15967openalex-snapshot
Voting on cyclic orders, group theory, and ballots
inferred← citeshttps://doi.org/10.1137/s0895480104442741openalex-snapshot
Improved Bounds for the Crossing Numbers of Km,n and Kn
inferred← citeshttps://doi.org/10.1145/1377676.1377739openalex-snapshot
Improved upper bounds on the crossing number
inferred← citeshttps://doi.org/10.12677/aam.2022.1111827openalex-snapshot
The Crossing Number of Generalized Petersen Graph P(4k,4)
inferred← citeshttps://doi.org/10.12677/aam.2024.132068openalex-snapshot
The Crossing Number of Rose Windows Graph R3k+2(1,3)
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.17877/de290r-367openalex-snapshot
Computing crossing numbers
inferred← citeshttps://doi.org/10.37236/2713openalex-snapshot
The Graph Crossing Number and its Variants: A Survey
inferred← citeshttps://doi.org/10.37236/728openalex-snapshot
The Minor Crossing Number of Graphs with an Excluded Minor
inferred← citeshttps://doi.org/10.48550/arxiv.math/0512392openalex-snapshot
A linear upper bound on the rectilinear crossing number
inferred← citeshttps://doi.org/10.48550/arxiv.math/0604467openalex-snapshot
Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
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.