New lower bounds on crossing numbers of K_m,n from semidefinite programming
DOI10.1007/S10107-023-02028-1zbMATH Open1547.05061MaRDI QIDQ6608048FDOQ6608048
Authors: Daniel Brosch, Sven C. Polak 
Publication date: 19 September 2024
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
semidefinite programmingsymmetry reductioncomplete bipartite graphblock-diagonalizationcrossing numbers
Graph theory (including graph drawing) in computer science (68R10) Semidefinite programming (90C22) Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial aspects of representation theory (05E10)
Cites Work
- Title not available (Why is that?)
- Symmetry groups, semidefinite programs, and sums of squares
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
- The graph crossing number and its variants: a survey
- Crossing Number is NP-Complete
- Title not available (Why is that?)
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- Semidefinite Code Bounds Based on Quadruple Distances
- Strengthened semidefinite programming bounds for codes
- Algebra of coinvariants and the action of a Coxeter element.
- Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
- The crossing number of K5,n
- Improved Bounds for the Crossing Numbers of Km,n and Kn
- On a problem of P. Turan concerning graphs
- Crossing Number Problems
- Semidefinite bounds for nonbinary codes based on quadruples
- Exploiting symmetry in copositive programs via semidefinite hierarchies
- 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: New lower bounds on crossing numbers of \(K_{m,n}\) from semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6608048)
