Two-regular subgraphs of odd-uniform hypergraphs
From MaRDI portal
Abstract: Let be an odd integer and let be a sufficiently large integer. We prove that the maximum number of edges in an -vertex -uniform hypergraph containing no -regular subgraphs is , and the equality holds if and only if is a full -star with center together with a maximal matching omitting . This verifies a conjecture of Mubayi and Verstra"{e}te.
Recommendations
Cites work
- scientific article; zbMATH DE number 5942358 (Why is no real title available?)
- scientific article; zbMATH DE number 4029608 (Why is no real title available?)
- scientific article; zbMATH DE number 3232670 (Why is no real title available?)
- scientific article; zbMATH DE number 3262986 (Why is no real title available?)
- A hypergraph extension of the bipartite Turán problem
- Dense graphs without 3-regular subgraphs
- Erdős-Ko-Rado in random hypergraphs
- Graphs without quadrilaterals
- Hypergraphs in which all disjoint pairs have distinct unions
- Maximum hypergraphs without regular subgraphs
- On Graphs that do not Contain a Thomsen Graph
- Regular subgraphs of dense graphs
- Regular subgraphs of uniform hypergraphs
- The maximum size of hypergraphs without generalized 4-cycles
- Two-regular subgraphs of hypergraphs
Cited in
(8)- Regular subgraphs of uniform hypergraphs
- Two-regular subgraphs of hypergraphs
- On even-degree subgraphs of linear hypergraphs
- Maximum hypergraphs without regular subgraphs
- On isomorphic subgraphs
- Indecomposable regular graphs and hypergraphs
- Regular subgraphs of linear hypergraphs
- Resolution of the Erdős–Sauer problem on regular subgraphs
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)