Subgraphs with Large Minimum $\ell$-Degree in Hypergraphs where Almost All $\ell$-Degrees are Large

Electronic Journal Of Combinatorics

Victor Falgas-Ravry¹ 

关键词: Hypergraphs;    $\ell$-Degree;    Extremal hypergraph theory;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

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 $\ell$-de

【 授权许可】

Others