Subgraphs with large minimum \(\ell\)-degree in hypergraphs where almost all \(\ell\)-degrees are large

zbMath1387.05171arXiv1610.06378MaRDI QIDQ1753092

Allan Lo, Victor Falgas-Ravry

Publication date: 25 May 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.06378

zbMATH Keywords

hypergraphsextremal hypergraph theory\(\ell\)-degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Vertex degrees (05C07)

Related Items (1)

The codegree threshold of \(K_4^-\)

Cites Work

• Embedding tetrahedra into quasirandom hypergraphs
• On the codegree density of complete 3-graphs and related problems
• On universality of graphs with uniformly distributed edges
• The codegree threshold of \(K_4^-\)
• On a Turán problem in weakly quasirandom 3-uniform hypergraphs
• Co-degree density of hypergraphs
• ${\ell}$-Degree Turán Density
• The Codegree Threshold for 3-Graphs with Independent Neighborhoods
• Extremal Problems on the Hypercube and the Codegree Turán Density of Complete $r$-Graphs
• Codegree Turán Density of Complete $r$-Uniform Hypergraphs
• On a generalisation of Mantel’s Theorem to Uniformly Dense Hypergraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Subgraphs with large minimum \(\ell\)-degree in hypergraphs where almost all \(\ell\)-degrees are large