Induced Decompositions of Highly Dense Graphs

DOI10.1002/jgt.21792zbMath1305.05119OpenAlexW1570420226MaRDI QIDQ2940990

Zsolt Tuza, Nathann Cohen

Publication date: 21 January 2015

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.21792

zbMATH Keywords

hypergraphsinduced decompositions

Mathematics Subject Classification ID

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

Uses Software

• SageMath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotic behavior of the chromatic index for hypergraphs
• Near perfect coverings in graphs and hypergraphs
• More-than-nearly-perfect packings and partial designs
• An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
• Support sizes of sixfold triple systems
• Covering and packing for pairs
• On a hypergraph matching problem
• Induced Decompositions of Graphs
• Maximal consistent families of triples

This page was built for publication: Induced Decompositions of Highly Dense Graphs