Two-regular subgraphs of hypergraphs

DOI10.1016/j.jctb.2008.10.005zbMath1223.05202OpenAlexW1971712900MaRDI QIDQ1026004

Dhruv Mubayi, Jacques Verstraete

Publication date: 23 June 2009

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2008.10.005

zbMATH Keywords

stabilityhypergraphsmatchingsregular subgraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (7)

On Even-Degree Subgraphs of Linear Hypergraphs ⋮ Regular subgraphs of uniform hypergraphs ⋮ Finding a minimal spanning hypertree of a weighted hypergraph ⋮ Two-regular subgraphs of odd-uniform hypergraphs ⋮ Resolution of the Erdős–Sauer problem on regular subgraphs ⋮ Maximum hypergraphs without regular subgraphs ⋮ Finding the shortest path for a Hypergraph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hypergraphs in which all disjoint pairs have distinct unions
• Every 4-regular graph plus an edge contains a 3-regular subgraph
• A new generalization of Mantel's theorem to \(k\)-graphs
• The maximum size of hypergraphs without generalized 4-cycles
• On a packing and covering problem
• A hypergraph extension of the bipartite Turán problem
• The Turán number of the Fano plane
• On a hypergraph Turán problem of Frankl
• An intersection theorem for four sets
• 4-books of three pages
• Structure and stability of triangle-free set systems
• Triple Systems Not Containing a Fano Configuration

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