×

zbMATH — the first resource for mathematics

Families of finite sets in which no set is covered by the union of two others. (English) Zbl 0489.05003
From the summary: “Let \(f^*(n)\) denote the maximum of \(k\)-subsets of an \(n\)-set satisfying the condition in the title. It is proved that \(f^{2t-1}(n)\leq f^{2t}(n+1)\leq\binom{n}{t}/\binom{2t-1}{t}\) with equalities holding iff there exists a Steiner system \(\mathcal{S}(t,2t-1,n)\). The bounds are approximately best possible for \(k\leq 6\) and of correct order of magnitude for \(k\geq 7\), as well, even if the corresponding Steiner systems do not exist.”
Reviewer: J.Libicher

MSC:
05A05 Permutations, words, matrices
05B07 Triple systems
05C65 Hypergraphs
Keywords:
subsets
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Erdös, P; Hanani, H, On a limit theorem in combinatorial analysis, Publ. math. debrecen, 10, 10-13, (1963) · Zbl 0122.24802
[2] {\scP. Frankl and Z. Füredi}, A new generalization of the Erdös-Ko-Rado theorem, Proc. J. Bull. London Math. Soc., submitted. · Zbl 0529.05001
[3] Hanani, H, On some tactical configurations, Canad. J. math., 15, 702-722, (1963) · Zbl 0196.29102
[4] Katona, G.O.H; Katona, G.O.H, A theorem of finite sets, (), 187-207 · Zbl 0878.05079
[5] Kirkman, T.P, On a problem in combinations, Cambridge and Dublin math. J., 2, 191-204, (1847)
[6] Kleitman, D.J; Shearer, J; Sturtevant, D, Intersections of k-element sets, Combinatorica, 1, 381-384, (1981) · Zbl 0489.05005
[7] Kruskal, J.B, The number of simplices in a complex, (), 251-278
[8] Erdös, P; Füredi, Z, The greatest angle among N points in the d-dimensional Euclidean space, (), in press · Zbl 0534.52007
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.