Regular subgraphs of uniform hypergraphs

DOI10.1016/j.jctb.2016.03.001zbMath1334.05094arXiv1502.02177OpenAlexW1582582384MaRDI QIDQ273181

Jae-Hoon Kim

Publication date: 21 April 2016

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

Full work available at URL: https://arxiv.org/abs/1502.02177

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 (4)

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 ⋮ Finding the shortest path for a Hypergraph

Cites Work

• Unnamed Item
• Unnamed Item
• Hypergraphs in which all disjoint pairs have distinct unions
• The maximum size of hypergraphs without generalized 4-cycles
• Two-regular subgraphs of hypergraphs
• Regular subgraphs of dense graphs
• Dense graphs without 3-regular subgraphs
• On extremal problems of graphs and generalized graphs
• Maximum hypergraphs without regular subgraphs
• Intersection theorems for systems of sets
• On Even-Degree Subgraphs of Linear Hypergraphs
• On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersection Theorems for Systems of Sets
• An intersection theorem for systems of sets

This page was built for publication: Regular subgraphs of uniform hypergraphs