No CrossRef data available.
Article contents
Counting spanning subgraphs in dense hypergraphs
Published online by Cambridge University Press: 30 May 2024
Abstract
We give a simple method to estimate the number of distinct copies of some classes of spanning subgraphs in hypergraphs with a high minimum degree. In particular, for each $k\geq 2$ and $1\leq \ell \leq k-1$, we show that every $k$-graph on $n$ vertices with minimum codegree at least
MSC classification
- Type
- Paper
- Information
- Copyright
- © The Author(s), 2024. Published by Cambridge University Press