Indecomposable regular graphs and hypergraphs
From MaRDI portal
Publication:1197014
DOI10.1016/0012-365X(92)90590-CzbMATH Open0755.05081OpenAlexW2080495191MaRDI QIDQ1197014FDOQ1197014
Authors: Zoltán Füredi
Publication date: 16 January 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(92)90590-c
Recommendations
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Matching theory
- Title not available (Why is that?)
- Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Fractional Covering Number of Hypergraphs
- Julius Petersen's theory of regular graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (8)
- Title not available (Why is that?)
- Ramsey properties of algebraic graphs and hypergraphs
- Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory
- Title not available (Why is that?)
- Maximum hypergraphs without regular subgraphs
- Indecomposable Laplacian integral graphs
- Decomposition of regular hypergraphs
- Hyper-regular graphs and high dimensional expanders
This page was built for publication: Indecomposable regular graphs and hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1197014)