Zarankiewicz's conjecture is finite for each fixed \(m\)
From MaRDI portal
Publication:1945996
DOI10.1016/j.jctb.2012.11.001zbMath1262.05030OpenAlexW2056775628MaRDI QIDQ1945996
Robin Christian, R. Bruce Richter, Gelasio Salazar
Publication date: 17 April 2013
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2012.11.001
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (14)
On the Crossing Number of Kn without Computer Assistance ⋮ The crossing number of \(K_{5,n+1} \setminus e\) ⋮ Drawings of complete graphs in the projective plane ⋮ Topological Drawings of Complete Bipartite Graphs ⋮ Exact crossing number parameterized by vertex cover ⋮ Rotation and crossing numbers for join products ⋮ The optimal drawings of \(K_{5,n}\) ⋮ On the crossing number of \(K_{13}\) ⋮ ON PROBLEMS OF -CONNECTED GRAPHS FOR ⋮ The conjecture on the crossing number of \(K_{1, m, n}\) is true if Zarankiewicz's conjecture holds ⋮ A survey of graphs with known or bounded crossing numbers ⋮ Bounding the number of non-duplicates of the \(q\)-side in simple drawings of \(K_{p,q}\) ⋮ Closing in on Hill's Conjecture ⋮ Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill
This page was built for publication: Zarankiewicz's conjecture is finite for each fixed \(m\)
