Improved lower bounds for the 2-page crossing numbers of \(K_{m,n}\) and \(K_n\) via semidefinite programming (Q2910885)
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: Improved lower bounds for the 2-page crossing numbers of K_m,n and K_n via semidefinite programming |
scientific article; zbMATH DE number 6081237
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved lower bounds for the 2-page crossing numbers of \(K_{m,n}\) and \(K_n\) via semidefinite programming |
scientific article; zbMATH DE number 6081237 |
Statements
12 September 2012
0 references
2-page crossing number
0 references
book crossing number
0 references
maximum cut
0 references
Goemans-Williamson max-cut bound
0 references
Improved lower bounds for the 2-page crossing numbers of \(K_{m,n}\) and \(K_n\) via semidefinite programming (English)
0 references
0.8735690116882324
0 references
0.8729134202003479
0 references
0.8723403811454773
0 references
0.8619094491004944
0 references
0.8443558216094971
0 references
