Decomposing Hypergraphs into Simple Hypertrees |
| |
Authors: | Raphael Yuster |
| |
Institution: | (1) Department of Mathematics, University of Haifa-ORANIM; Tivon 36006, Israel; E-mail: raphy@macam98.ac.il, IL |
| |
Abstract: | T be a simple k-uniform hypertree with t edges. It is shown that if H is any k-uniform hypergraph with n vertices and with minimum degree at least , and the number of edges of H is a multiple of t then H has a T-decomposition. This result is asymptotically best possible for all simple hypertrees with at least two edges.
Received December 28, 1998 |
| |
Keywords: | AMS Subject Classification (1991) Classes: 05C65 05C70 |
本文献已被 SpringerLink 等数据库收录! |