Maximum number of edges of a bipartite graph without complete bipartite subgraphs (Q3625838)
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 5555982
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum number of edges of a bipartite graph without complete bipartite subgraphs |
scientific article; zbMATH DE number 5555982 |
Statements
22 May 2009
0 references
0.9329898357391356
0 references
0.8825763463973999
0 references
0.872148871421814
0 references
0.8247588276863098
0 references
