Two-regular subgraphs of odd-uniform hypergraphs

From MaRDI portal




Abstract: Let kge3 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 , 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"{e}te.









This page was built for publication: Two-regular subgraphs of odd-uniform hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1682214)