Colored packing of sets

P. Frankl, Z. Füredi

Research output: Article

3 Citations (Scopus)

Abstract

Let H be a family of t-sets on {l,2, …, k}. A family of k-sets on v elements is called a (v, k, ϰ)-packing if for all F ∈ there is a copy of ϰ, ϰF such that the t-sets of F corresponding to HF are covered only by F. Clearly, and if ϰ is the complete t-hypergraph then we obtain the usual definition of the (partial) Steiner-system. The main result of this paper is that for every fixed k and ϰ the size of the largest ϰ-packing is, whenever v → ∞.

Original languageEnglish
Pages (from-to)165-177
Number of pages13
JournalNorth-Holland Mathematics Studies
Volume149
Issue numberC
DOIs
Publication statusPublished - jan. 1987

    Fingerprint

ASJC Scopus subject areas

  • Mathematics(all)

Cite this