Subgraphs with large minimum \(\ell\)-degree in hypergraphs where almost all \(\ell\)-degrees are large (Q1753092)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Subgraphs with large minimum \(\ell\)-degree in hypergraphs where almost all \(\ell\)-degrees are large |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Subgraphs with large minimum \(\ell\)-degree in hypergraphs where almost all \(\ell\)-degrees are large |
scientific article |
Statements
Subgraphs with large minimum \(\ell\)-degree in hypergraphs where almost all \(\ell\)-degrees are large (English)
0 references
25 May 2018
0 references
Summary: Let \(G\) be an \(r\)-uniform hypergraph on \(n\) vertices such that all but at most \(\epsilon \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\)-degree.
0 references
hypergraphs
0 references
\(\ell\)-degree
0 references
extremal hypergraph theory
0 references
