The conjecture on the crossing number of \(K_{1, m, n}\) is true if Zarankiewicz's conjecture holds

DOI10.1007/s00373-021-02303-yzbMath1470.05045OpenAlexW3145907718WikidataQ113905214 ScholiaQ113905214MaRDI QIDQ2045399

Yanyan Li

Publication date: 12 August 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-021-02303-y

zbMATH Keywords

complete bipartite graphcrossing numbergood drawingcomplete tripartite graphZarankiewicz's conjecture

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Unnamed Item
• The crossing number of \(K_{1,m,n}\)
• A successful concept for measuring non-planarity of graphs: The crossing number.
• Zarankiewicz's conjecture is finite for each fixed \(m\)
• The graph crossing number and its variants: a survey
• The crossing number of \(K_{1,4,n}\)
• The crossing number ofK1,3,n andK2,3,n
• Crossing Numbers of Graphs
• The crossing number of K5,n
• Über die Kreuzungszahl vollständiger, n‐geteilter Graphen
• On a problem of P. Turan concerning graphs

This page was built for publication: The conjecture on the crossing number of \(K_{1, m, n}\) is true if Zarankiewicz's conjecture holds