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

Research output: Contribution to journalArticlepeer-review

• 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 language English P2.18 The Electronic Journal of Combinatorics 25 2 Published - 27 Apr 2018

## Keywords

• math.CO, 05C65, 05D99