论文信息 - On sperner families in which nok sets have an empty intersection III

On sperner families in which nok sets have an empty intersection III

LetR be anr-element set and ℱ be a Sperner family of its subsets, that is,X ⊈Y for all differentX, Y ∈ ℱ. The maximum cardinality of ℱ is determined under the conditions 1)c≦|X|≦d for allX ∈ ℱ, (c andd are fixed integers) and 2) nok sets (k≧4, fixed integer) in ℱ have an empty intersection. The result is mainly based on a theorem which is proved by induction, simultaneously with a theorem of Frankl.

Hans-Dietrich O. F. Gronau

[1] Anthony J. W. Hilton,et al. Some Results on Sperner Families , 1979, J. Comb. Theory, Ser. A.

[2] Anthony J. W. Hilton,et al. Existence Theorems for Sperner Families , 1974, J. Comb. Theory, Ser. A.

[3] Paul Erdös,et al. INTERSECTION PROPERTIES OF SYSTEMS OF FINITE SETS , 1978 .

[4] Peter Frankl. Families of finite sets with prescribed cardinalities for pairwise intersections , 1980 .

[5] L. D. Meshalkin. Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set , 1963 .

[6] Peter Frankl. Extremal Problems and Coverings of the Space , 1980, Eur. J. Comb..

[7] Peter Frankl,et al. On Sperner Families Satisfying an Additional Condition , 1976, J. Comb. Theory, Ser. A.

[8] A. J. W. Hilton,et al. SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS , 1967 .

[9] Koichiro Yamamoto. Logarithmic order of free distributive lattice , 1954 .

[10] Richard M. Wilson,et al. On $t$-designs , 1975 .

[11] Hans-Dietrich O. F. Gronau. On Sperner families in which no 3 sets have an empty intersection , 1979, Acta Cybern..

[12] P. Erdös,et al. INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS , 1961 .

[13] H. Gronau. Sperner type theorems and complexity of minimal disjunctive normal forms of monotone boolean functions , 1981 .

[14] G. F. Clements,et al. A minimization problem concerning subsets of a finite set , 1973, Discret. Math..