Hypergraphs with infinitely many extremal constructions
Hypergraphs with infinitely many extremal constructions, Discrete Analysis 2023:18, 34 pp. A fundamental result in extremal graph theory, Turán's theorem, states that the maximal number of edges of a graph with $n$ vertices that does not contain a clique with $r$ vertices is attained by a comp...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Diamond Open Access Journals
2023-12-01
|
| Series: | Discrete Analysis |
| Online Access: | https://doi.org/10.19086/da.88508 |