Decomposing hypergraphs into simple hypertrees

DOI10.1007/s004930070036zbMath0949.05056OpenAlexW2009666814MaRDI QIDQ1586356

Raphael Yuster

Publication date: 13 November 2000

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004930070036

zbMATH Keywords

decompositionhypergraphshypertree

Mathematics Subject Classification ID

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

Related Items (3)

The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 ⋮ Decomposing uniform hypergraphs into uniform hypertrees and single edges ⋮ Fractional decompositions of dense hypergraphs

This page was built for publication: Decomposing hypergraphs into simple hypertrees