Statements (14)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:author |
gptkb:Zoltán_Füredi
|
| gptkbp:field |
graph theory
extremal combinatorics |
| gptkbp:namedAfter |
gptkb:Zoltán_Füredi
|
| gptkbp:publishedIn |
gptkb:Discrete_Mathematics
|
| gptkbp:relatedTo |
gptkb:Turán's_theorem
gptkb:hypergraph |
| gptkbp:sentence |
Provides an upper bound on the number of edges in a uniform hypergraph avoiding a given subhypergraph.
|
| gptkbp:topic |
hypergraph Turán-type problems
|
| gptkbp:yearProved |
1981
|
| gptkbp:bfsParent |
gptkb:Zoltán_Füredi
|
| gptkbp:bfsLayer |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
Füredi's theorem
|