×

Disjoint r-tuples in an r-graph with given maximum degree. (English) Zbl 0543.05049

R-uniform hypergraphs H with a given maximum degree D(H) are investigated. Given positive integers v, D denote by \(f_ r(v,D)\) the maximum number of r-tuples contained in an r-graph H with v(H)\(\leq v\) and D(H)\(\leq D\), where v(H) is the maximum number of pairwise disjoint r- tuples of H. The aim of the paper is to prove some conjecture concerning the function \(f_ r\).
Reviewer: L.Zaremba

MSC:

05C65 Hypergraphs
PDFBibTeX XMLCite
Full Text: DOI