Rational decomposition of dense hypergraphs and some related eigenvalue estimates

DOI10.1016/j.laa.2012.01.014zbMath1241.05113OpenAlexW2012217557MaRDI QIDQ417511

Peter J. Dukes

Publication date: 14 May 2012

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2012.01.014

zbMATH Keywords

\(t\)-designgraph decompositionJohnson scheme\(t\)-grapheigenvalue perturbationfractional decomposition

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (7)

Fractional Triangle Decompositions in Graphs with Large Minimum Degree ⋮ Fractional clique decompositions of dense graphs and hypergraphs ⋮ Fractional Clique Decompositions of Dense Partite Graphs ⋮ Edge-decompositions of graphs with high minimum degree ⋮ Progress towards Nash-Williams' conjecture on triangle decompositions ⋮ Corrigendum to ``Rational decomposition of dense hypergraphs and some related eigenvalue estimates ⋮ Edge-decompositions of graphs with high minimum degree

Cites Work

• Unnamed Item
• An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures
• Asymptotically optimal \(K_k\)-packings of dense graphs via fractional \(K_k\)-decompositions
• The quasi-randomness of hypergraph cut properties
• Fractional decompositions of dense hypergraphs

This page was built for publication: Rational decomposition of dense hypergraphs and some related eigenvalue estimates