On the maximum size of (p, Q)-free families
暂无分享,去创建一个
[1] E. Sperner. Ein Satz über Untermengen einer endlichen Menge , 1928 .
[2] P. Erdös,et al. INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS , 1961 .
[3] E. C. Milner. A Combinatorial Theorem on Systems of Sets , 1968 .
[4] D. Kleitman. On families of subsets of a finite set containing no two disjoint sets and their union , 1968 .
[5] D. Kleitman. Maximal number of subsets of a finite set No k of which are pairwise disjoint , 1968 .
[6] B. Lindström. Determination of two vectors from the sum , 1969 .
[7] P. Erdös,et al. Intersection theorems for systems of sets (ii) , 1969 .
[8] P. Erdos,et al. On collections of subsets containing no 4-member Boolean algebra. , 1971 .
[9] B. Lindström. On B2-sequences of vectors , 1972 .
[10] Joel H. Spencer,et al. Families of k-independent sets , 1973, Discret. Math..
[11] Daniel J. Kleitman. Extremal Properties of Collections of Subsets Containing No Two Sets and Their Union , 1976, J. Comb. Theory, Ser. A.
[12] P. Frankl. Families of finite sets containing nok disjoint sets and their union , 1977 .
[13] J. Spencer. Intersection Theorems for Systems of Sets , 1977, Canadian Mathematical Bulletin.
[14] Endre Szemerédi,et al. Combinatorial Properties of Systems of Sets , 1978, J. Comb. Theory, Ser. A.
[15] Tom C. Brown,et al. Lines Imply Spaces in Density Ramsey Theory , 1984, J. Comb. Theory, Ser. A.
[16] Noga Alon,et al. Explicit construction of exponential sized families of k-independent sets , 1986, Discret. Math..
[17] P. Frankl,et al. Intersection and Containment Problems Without Size Restrictions , 1988 .
[18] P. Frankl,et al. Algebraic, extremal and metric combinatorics, 1986 , 1988 .
[19] Peter Frankl. Asymptotic solution of a turán-type problem , 1990, Graphs Comb..
[20] Z. Füredi. Surveys in Combinatorics, 1991: “Turán Type Problems” , 1991 .
[21] Paul Erdös,et al. On product representations of powers, I , 1995, Eur. J. Comb..
[22] Alexandr V. Kostochka,et al. Intersection Statements for Systems of Sets , 1997, J. Comb. Theory, Ser. A.
[23] Linyuan Lu. An Upper Bound for the Turr an Number T 3 (n; 4) , 1999 .
[24] Vojtech Rödl,et al. Extremal Problems for Sets Forming Boolean Algebras and Complete Partite Hypergraphs , 1999, J. Comb. Theory, Ser. A.
[25] Noga Alon,et al. Locally Thin Set Families , 2000, Comb. Probab. Comput..
[26] Noga Alon,et al. String Quartets in Binary , 2000, Combinatorics, Probability and Computing.
[27] János Körner,et al. A Better Bound for Locally Thin Set Families , 2001, J. Comb. Theory, Ser. A.
[28] Angelo Monti,et al. Self-Similarity Bounds for Locally Thin Set Families , 2001, Comb. Probab. Comput..