Abstract
Letn, k, t be integers,n>k>t≧0, and letm(n, k, t) denote the maximum number of sets, in a family ofk-subsets of ann-set, no two of which intersect in exactlyt elements. The problem of determiningm(n, k, t) was raised by Erdős in 1975. In the present paper we prove that ifk≦2t+1 andk−t is a prime, thenm(n, k, t)≦( n t )( 2k-t-1 k )/( 2k-t-1 t ). Moreover, equality holds if and only if an (n, 2k−t−1,t)-Steiner system exists. The proof uses a linear algebraic approach.
This is a preview of subscription content, access via your institution.
References
- [1]
P. Erdős, Problems and results in graph theory and combinatorial analysis,Proc. Fifth British Comb. Conf. 1975 Aberdeen, Congressus Numerantium, 15 — Utilitas Math., Winnipeg, 1976.
- [2]
P. Erdős, C. Ko andR. Rado, Intersection theorems for systems of finite sets,Quart. J. Math. Oxford (2),12 (1961), 313–320.
- [3]
P. Frankl, On families of finite sets no two of which intersect in a singleton,Bull. Austral. Math. Soc. 17 (1977), 125–134.
- [4]
P. Frankl, Extremal problems and coverings of the space,European J. Comb. 1 (1980), 101–106.
- [5]
P. Frankl andZ. Füredi, On families of finite sets no two of which intersect in a given number of elements,J. Comb. Th. (A), to appear.
- [6]
P. Frankl andR. M. Wilson, Intersection theorems with geometric consequences,Combinatorica 1 (1981), 357–368.
- [7]
V. Rödl, Almost Steiner systems always exist, to appear.
Author information
Affiliations
Rights and permissions
About this article
Cite this article
Frankl, P. An extremal set theoretical characterization of some steiner systems. Combinatorica 3, 193–199 (1983). https://doi.org/10.1007/BF02579293
Received:
Issue Date:
AMS subject classification (1980)
- 05 C 65
- 05 B 05