Improved lower bounds on book crossing numbers of complete graphs (Q2848524)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6211997
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved lower bounds on book crossing numbers of complete graphs |
scientific article; zbMATH DE number 6211997 |
Statements
26 September 2013
0 references
2-page crossing number
0 references
book crossing number
0 references
semidefinite programming
0 references
maximum \(k\)-cut
0 references
Frieze-Jerrum maximum-\(k\)-cut bound
0 references
maximum satisfiability problem
0 references
Improved lower bounds on book crossing numbers of complete graphs (English)
0 references
0.8814966082572937
0 references
0.8657549023628235
0 references
