On the crossing number of \(K_{m,n}\) (Q1408549): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:30, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the crossing number of \(K_{m,n}\) |
scientific article |
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
