Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
bipartite graphs
|
| gptkbp:concerns |
upper bound on edges in bipartite graphs without complete bipartite subgraphs
|
| gptkbp:field |
gptkb:extremal_graph_theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Kővári–Sós–Turán theorem
|
| gptkbp:namedAfter |
gptkb:Vera_T._Sós
gptkb:Pál_Turán gptkb:Tibor_Kővári |
| gptkbp:publicationYear |
1954
|
| gptkbp:publishedIn |
gptkb:Acta_Mathematica_Academiae_Scientiarum_Hungaricae
|
| gptkbp:state |
If a bipartite graph with parts of size m and n contains no complete bipartite subgraph K_{s,t}, then the number of edges is O(n^{2-1/s})
|
| gptkbp:bfsParent |
gptkb:Zarankiewicz_problem
|
| gptkbp:bfsLayer |
7
|