The crossing number of K11 is 100

DOI10.1002/JGT.20249MaRDI QIDQ5434249zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Shengjun Pan, R. B. Richter

Publication date 4 January 2008

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.20249

zbMATH Keywords

complete graphcrossing number

Mathematics Subject Classification ID

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

Recommendations

• On the crossing number of K_n without computer assistance
• On the crossing number of \(K_{13}\)
• On the crossing number of complete graphs
• On the crossing number of complete graphs
• The rectilinear crossing number of \(K_{10}\) is 62

Cited in

(33)

• An evolutionary formulation of the crossing number problem
• The crossing number of locally twisted cubes \(L T Q_n\)
• Crossing number for graphs with bounded pathwidth
• A contribution to Guy's conjecture
• The crossing number of \(K_{5,n+1} \setminus e\)
• Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\)
• Empty triangles in good drawings of the complete graph
• \(K_7\)-minors in optimal 1-planar graphs
• The early history of the brick factory problem
• The crossing number of the Cartesian product of paths with complete graphs
• Shellable drawings and the cylindrical crossing number of \(K_n\)
• Fan-crossing free graphs and their relationship to other beyond-planar graphs
• Expected crossing numbers
• An upper bound for the crossing number of augmented cubes
• An effective crossing minimisation heuristic based on star insertion
• On the crossing number of K_n without computer assistance
• The Crossing Number of Graphs: Theory and Computation
• Bishellable drawings of K_n
• A note on the cross-index of a complete graph based on a linear tree
• On the crossing number of \(K_{13}\)
• On Numerical Invariant of Graph
• scientific article; zbMATH DE number 7278018 (Why is no real title available?)
• A survey of graphs with known or bounded crossing numbers
• Closing in on Hill's conjecture
• Recent advances in exact crossing minimization (extended abstract)
• Turán's brick factory problem: the status of the conjectures of Zarankiewicz and Hill
• The rectilinear crossing number of \(K_{10}\) is 62
• Bounding the tripartite‐circle crossing number of complete tripartite graphs
• From art and circuit design to geometry and combinatorics
• Drawings of complete graphs in the projective plane
• On the problems of CF-connected graphs
• The crossing number of nearly complete bipartite graphs
• The crossing number of \(K_{1,m,n}\)

This page was built for publication: The crossing number of K₁₁ is 100

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