Subgraphs with large minimum ℓ-degree in hypergraphs where almost all ℓ-degrees are large

Research output: Contribution to journalArticlepeer-review

Authors

Colleges, School and Institutes

External organisations

  • Umea Univ

Abstract

Let G be an r-uniform hypergraph on n vertices such that all but at most $\varepsilon \binom{n}{\ell}$ $\ell$-subsets of vertices have degree at least $p \binom{n-\ell}{r-\ell}$. We show that G contains a large subgraph with high minimum ℓ-degree.

Details

Original languageEnglish
Article numberP2.18
JournalThe Electronic Journal of Combinatorics
Volume25
Issue number2
Publication statusPublished - 27 Apr 2018

Keywords

  • math.CO, 05C65, 05D99