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

2016/10/20 by Victor Falgas‐Ravry, Allan Lo, Falgas-Ravry, Victor +1
Computer Science · Engineering · Mathematics · #05C65 #05D99 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1610.06378

openalex publication_date 2016/10/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Let G be an r-uniform hypergraph on n vertices such that all but at\nmost \ε binomn\ℓ \ℓ-subsets of vertices have degree at\nleast p binomn-\ℓr-\ℓ.\n We show that G contains a large subgraph with high minimum \ℓ-degree.\n

Related

• Matching in hypergraphs of large minimum degree
• On the largest degrees in intersecting hypergraphs
• On the sizes of k-edge-maximal r-uniform hypergraphs
• On the sizes of vertex-k-maximal r-uniform hypergraphs
• A note on perfect matchings in uniform hypergraphs