Maximum hypergraphs without regular subgraphs

DOI10.7151/DMGT.1722MaRDI QIDQ2442274zbMATH OpenOpenAlexFDO

Authors Jaehoon Kim, Alexandr Kostochka

Publication date 2 April 2014

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.7151/dmgt.1722

zbMATH Keywords

hypergraphsregular graphset systemsubgraph

Mathematics Subject Classification ID

Hypergraphs (05C65)

Recommendations

• Regular subgraphs of uniform hypergraphs
• Two-regular subgraphs of hypergraphs
• Two-regular subgraphs of odd-uniform hypergraphs
• On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
• Indecomposable regular graphs and hypergraphs

Cites work

• Dense graphs without 3-regular subgraphs
• scientific article; zbMATH DE number 568811 (Why is no real title available?)
• Note on regular subgraphs
• Regular subgraphs of almost regular graphs
• Regular subgraphs of dense graphs
• Regular subpseudographs of regular pseudographs
• Three-regular parts of four-regular graphs
• Two-regular subgraphs of hypergraphs

Cited in

(12)

• Two-regular subgraphs of hypergraphs
• Large regular graphs with no induced \(2K_ 2\)
• Indecomposable regular graphs and hypergraphs
• Two-regular subgraphs of odd-uniform hypergraphs
• Finding a minimal spanning hypertree of a weighted hypergraph
• Regular subgraphs of uniform hypergraphs
• On even-degree subgraphs of linear hypergraphs
• Finding the shortest path for a hypergraph
• Hypergraphs without non-trivial intersecting subgraphs
• Resolution of the Erdős–Sauer problem on regular subgraphs
• Regular subgraphs of linear hypergraphs
• Regular subgraphs at every density

This page was built for publication: Maximum hypergraphs without regular subgraphs

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