A lower bound on the crossing number of the complete tripartite graph \(K_{1,2p+1,2q+1}\). (Q5033154)
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: A lower bound on the crossing number of the complete tripartite graph Kâ,2p+1,2q+1. |
scientific article; zbMATH DE number 7478564
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound on the crossing number of the complete tripartite graph \(K_{1,2p+1,2q+1}\). |
scientific article; zbMATH DE number 7478564 |
Statements
22 February 2022
0 references
crossing number
0 references
complete tripartite graph
0 references
complete bipartite graph
0 references
good drawing
0 references
Zarankiewic's conjecture
0 references
0.9565448760986328
0 references
0.9191966652870178
0 references
0.916018843650818
0 references
0.912439227104187
0 references
