Decomposing hypergraphs into simple hypertrees

Raphael Yuster

doi:10.1007/s004930070036

Decomposing hypergraphs into simple hypertrees

Raphael Yuster

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

Let 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 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. This result is asymptotically best possible for all simple hypertrees with at least two edges.

Original language	English
Pages (from-to)	119-140
Number of pages	22
Journal	Combinatorica
Volume	20
Issue number	1
DOIs	https://doi.org/10.1007/s004930070036
State	Published - 2000

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Computational Mathematics

Access to Document

10.1007/s004930070036

Cite this

@article{d5d752a638aa408da1b2bb25e4daf80e,

title = "Decomposing hypergraphs into simple hypertrees",

abstract = "Let 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 nk-1/2k-1 (k-1)! (1 + o(1)), 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.",

author = "Raphael Yuster",

year = "2000",

doi = "10.1007/s004930070036",

language = "English",

volume = "20",

pages = "119--140",

journal = "Combinatorica",

issn = "0209-9683",

publisher = "Janos Bolyai Mathematical Society",

number = "1",

}

TY - JOUR

T1 - Decomposing hypergraphs into simple hypertrees

AU - Yuster, Raphael

PY - 2000

Y1 - 2000

N2 - Let 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 nk-1/2k-1 (k-1)! (1 + o(1)), 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.

AB - Let 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 nk-1/2k-1 (k-1)! (1 + o(1)), 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.

UR - https://www.scopus.com/pages/publications/0034366303

U2 - 10.1007/s004930070036

DO - 10.1007/s004930070036

M3 - Article

AN - SCOPUS:0034366303

SN - 0209-9683

VL - 20

SP - 119

EP - 140

JO - Combinatorica

JF - Combinatorica

IS - 1

ER -

Decomposing hypergraphs into simple hypertrees

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this