2016/04/30 by Jie Han, Jaehoon Kim
Decision Sciences · Mathematics · #Advanced Topology and Set Theory #Combinatorics #Discrete mathematics #Fuzzy and Soft Set Theory #Hypergraph #Mathematics #Tensor decomposition and applications #math.CO
paper · pdf · doi:10.1016/j.jctb.2017.08.009
openalex publication_date 2017/09/12 · arxiv created 2018/01/22 · arxiv updated 2018/01/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/06
Let k≥ 3 be an odd integer and let n be a sufficiently large integer. We prove that the maximum number of edges in an n-vertex k-uniform hypergraph containing no 2-regular subgraphs is \binomn-1k-1 + \lfloor(n-1)/(k) \rfloor, and the equality holds if and only if H is a full k-star with center v together with a maximal matching omitting v. This verifies a conjecture of Mubayi and Verstraëte.