A lower bound on the crossing number of the complete tripartite graph K₁,2p+1,2q+1.

zbMATH Open1499.05173MaRDI QIDQ5033154FDOQ5033154

Authors:

Publication date: 22 February 2022

Recommendations

• The conjecture on the crossing number of \(K_{1, m, n}\) is true if Zarankiewicz's conjecture holds
• The crossing number of \(K_{1,m,n}\)
• On the crossing number of the complete tripartite graph \(K_{1,8,n}\)
• Crossing number of the complete tripartite graph \(K_{1,10,n}\)
• scientific article; zbMATH DE number 2156833

zbMATH Keywords

complete bipartite graphcrossing numbergood drawingcomplete tripartite graphZarankiewic's conjecture

Mathematics Subject Classification ID

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

Cited In (7)

• The crossing number of \(K_{1,m,n}\)
• Bounding the tripartite‐circle crossing number of complete tripartite graphs
• Crossing number of the complete tripartite graph \(K_{1,10,n}\)
• On the crossing number of the complete tripartite graph \(K_{1,8,n}\)
• Bounding the tripartite-circle crossing number of complete tripartite graphs
• The conjecture on the crossing number of \(K_{1, m, n}\) is true if Zarankiewicz's conjecture holds
• On crossing numbers of complete tripartite and balanced complete multipartite graphs

This page was built for publication: A lower bound on the crossing number of the complete tripartite graph \(K_{1,2p+1,2q+1}\).

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5033154)