On the crossing number of \(K_{m,n}\) (Q1408549)
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 1985383
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the crossing number of \(K_{m,n}\) |
scientific article; zbMATH DE number 1985383 |
Statements
On the crossing number of \(K_{m,n}\) (English)
0 references
24 September 2003
0 references
Summary: The best lower bound known on the crossing number of the complete bipartite graph is \(\text{cr}(K_{m,n}) \geq (1/5)m(m-1)\lfloor n/2\rfloor\lfloor(n-1)/2\rfloor.\) We prove that \(\text{cr}(K_{m,n}) \geq (1/5)m(m-1)\lfloor n/2 \rfloor \lfloor (n-1)/2 \rfloor + 9.9 \times 10^{-6} m^2n^2\) for sufficiently large \(m\) and \(n\).
0 references
0.9007003307342529
0 references
0.8941490054130554
0 references
0.8561630845069885
0 references
0.8443558216094971
0 references
0.8436790108680725
0 references
