New lower bounds on crossing numbers of \(K_{m,n}\) from semidefinite programming (Q6608048)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: New lower bounds on crossing numbers of K_m,n from semidefinite programming |
scientific article; zbMATH DE number 7915928
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New lower bounds on crossing numbers of \(K_{m,n}\) from semidefinite programming |
scientific article; zbMATH DE number 7915928 |
Statements
New lower bounds on crossing numbers of \(K_{m,n}\) from semidefinite programming (English)
0 references
19 September 2024
0 references
crossing numbers
0 references
complete bipartite graph
0 references
semidefinite programming
0 references
symmetry reduction
0 references
block-diagonalization
0 references
0.851468026638031
0 references
0.8347980380058289
0 references
0.8021543622016907
0 references
0.7962433695793152
0 references
0.780569314956665
0 references
