Decomposing hypergraphs into simple hypertrees
type: Item
instance of: scholarly article
title: Decomposing hypergraphs into simple hypertrees
zbMATH Open document ID: 0949.05056
author: Raphael Yuster
published in: Combinatorica
publication date: 2000-11-13T00:00:00Z
review text: Let \(T\) be a simple \(k\)-uniform hypertree with \(t\) edges. The author proves that if \(H\) is any \(k\)-uniform hypergraph with \(n\) vertices and with minimum degree at least \[ \frac{n^{k-1}}{2^{k-1}(k-1)!} (1+o(1)), \] and the number of edges of \(H\) is a multiple of \(t\) then \(H\) has a \(T\)-decomposition. Moreover, the author gives some open problems.
reviewed by: Ferdinand Gliviak
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 1528650
zbMATH Keywords: hypergraphs
zbMATH Keywords: hypertree
zbMATH Keywords: decomposition
MaRDI profile type: Publication
full work available at URL: s004930070036
OpenAlex ID: W2009666814
DOI: 10.1007/S004930070036
Recommended article: Decompositions of graphs into trees
Recommended article: Q4873673
Recommended article: Decomposing uniform hypergraphs into uniform hypertrees and single edges
Recommended article: Q4320816
Recommended article: Decomposition of complete graphs into arbitrary trees
Recommended article: Q3315548
Recommended article: Tree decompositions for a class of graphs
Recommended article: Q4779133
Recommended article: Tree decomposition of graphs
Recommended article: Tree decompositions of multigraphs
description: scientific article; zbMATH DE number 1528650