Turán problems in graphs and hypergraphs
Mantel's theorem says that among all triangle-free graphs of a given order the balanced complete bipartite graph is the unique graph of maximum size. In Chapter 2, we prove an analogue of this result for 3-graphs (3-uniform hy¬pergraphs) together with an associated stability result. Let K− 4 ,...
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
University College London (University of London)
2017
|
| Subjects: | |
| Online Access: | https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.746801 |