Statements (12)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:concerns |
bipartite graphs
|
| gptkbp:field |
gptkb:extremal_graph_theory
combinatorics |
| https://www.w3.org/2000/01/rdf-schema#label |
Zarankiewicz problem
|
| gptkbp:namedAfter |
gptkb:Kazimierz_Zarankiewicz
|
| gptkbp:relatedTo |
gptkb:Kővári–Sós–Turán_theorem
Turán-type problems |
| gptkbp:type |
maximum number of edges in a bipartite graph avoiding a complete bipartite subgraph
|
| gptkbp:yearProposed |
1951
|
| gptkbp:bfsParent |
gptkb:Kazimierz_Zarankiewicz
|
| gptkbp:bfsLayer |
6
|