Two-Part and k-Sperner Families: New Proofs Using Permutations
暂无分享,去创建一个
[1] Gyula O. H. Katona. The Cycle Method and Its Limits , 2000 .
[2] Gyula O. H. Katona,et al. Extremal hypergraph problems and convex hulls , 1985, Comb..
[3] W. J. Thron,et al. Encyclopedia of Mathematics and its Applications. , 1982 .
[4] Peter Frankl,et al. A generalization of Sperner's theorem , 1981 .
[5] P. Erdös. On a lemma of Littlewood and Offord , 1945 .
[6] Shahriar Shahriari,et al. On the structure of maximum 2-part Sperner families , 1996, Discret. Math..
[7] K. Engel. Sperner Theory , 1996 .
[8] G. Winskel. What Is Discrete Mathematics , 2007 .
[9] Zoltán Füredi,et al. Ramsey-Sperner theory , 1987, Discret. Math..
[10] Gyula O. H. Katona,et al. Extremal Problems for Hypergraphs , 1975 .
[11] Gyula O. H. Katona,et al. All maximum 2-part Sperner families , 1986, J. Comb. Theory, Ser. A.
[12] E. Sperner. Ein Satz über Untermengen einer endlichen Menge , 1928 .
[13] Koichiro Yamamoto. Logarithmic order of free distributive lattice , 1954 .
[14] Daniel J. Kleitman,et al. On a lemma of Littlewood and Offord on the distribution of certain sums , 1965 .
[15] Gyula O. H. Katona. A simple proof of the Erd?s-Chao Ko-Rado theorem , 1972 .
[16] D. Lubell. A Short Proof of Sperner’s Lemma , 1966 .
[17] B. Bollobás. On generalized graphs , 1965 .