Abstract
The following problem was answered by a theorem of Kruskal, Katona, and Lindström about 20 years ago: Given a family ofk-element sets ℱ, |ℱ|=m, at least how many (k-d)-element subsets are contained in the members of ℱ? This paper deals with the extremal families, e.g., they are completely described for infinitely many values ofm.
Similar content being viewed by others
References
P. Erdős, C. Ko andR. Rado, Intersection theorems for systems of finite sets,Quart. J. Math. Oxford (2) 12 (1961), 313–320.
P. Frankl, A new short proof for the Kruskal—Katona theorem,Discrete Math. 48 (1984), 327–329.
G. O. H. Katona, A theorem of finite sets,in: Theory of Graphs. Proc. Colloq. Tihany 1966 (Akadémiai Kiadó, 1968), 187–207.
J. B. Kruskal, The number of simplices in a complex,in: Math. Opt. Techniques (Univ. of Calif. Press, 1963), 251–278.
B. Lindström andM. O. Zetterström, A combinatorial problem in thek-adic number system,Proc. A. M. S. 18 (1957), 166–170.
L. Lovász,Combinatorial Problems and Exercises (Academiai Kiadó, (Budapest)—North-Holland Publ. (Amsterdam), 1979). Problem 13. 31.
M. Mörs, A generalization of a theorem of Kruskal,Graphs and Combinatorics 1 (1985), 167–183.
Author information
Authors and Affiliations
Additional information
Research of second author supported in part by the National Science Foundation.
Rights and permissions
About this article
Cite this article
Füredi, Z., Griggs, J.R. Families of finite sets with minimum shadows. Combinatorica 6, 355–363 (1986). https://doi.org/10.1007/BF02579261
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02579261