INTERSECTION PROBLEMS IN COMBINATORICS

[1]  Norihide Tokushige,et al.  Weighted multiply intersecting families , 2003 .

[2]  Norihide Tokushige,et al.  Weighted 3-Wise 2-Intersecting Families , 2002, J. Comb. Theory, Ser. A.

[3]  A. Robert Calderbank,et al.  Improved Upper Bounds Concerning the Erdős-Ko-Rado Theorem , 1992, Combinatorics, Probability and Computing.

[4]  László A. Székely,et al.  Erdős–Ko–Rado and Hilton–Milner Type Theorems for Intersecting Chains in Posets , 2000, Comb..

[5]  Norihide Tokushige.  Multiply-intersecting families revisited , 2007, J. Comb. Theory, Ser. B.

[6]  B. M. I. Rands.  An Extension of the Erdös, Ko, Rado Theorem to t-Designs , 1982, J. Comb. Theory, Ser. A.

[7]  S. Safra,et al.  On the hardness of approximating minimum vertex cover , 2005 .

[8]  Norihide Tokushige,et al.  Weighted Non-Trivial Multiply Intersecting Families , 2006, Comb..

[9]  I. Anderson.  Combinatorics of Finite Sets , 1987 .

[10]  Rudolf Ahlswede,et al.  Contributions to the geometry of hamming spaces , 1977, Discret. Math..

[11]  Norihide Tokushige,et al.  Random walks and multiply intersecting families , 2005, J. Comb. Theory, Ser. A.

[12]  Norihide Tokushige,et al.  A generalization of the katona theorem for crosst-intersecting families , 1989, Graphs Comb..

[13]  Gyula O. H. Katona.  A simple proof of the Erd?s-Chao Ko-Rado theorem , 1972 .

[14]  Peter Frankl,et al.  On the Maximum Number of Permutations with Given Maximal or Minimal Distance , 1977, J. Comb. Theory, Ser. A.

[15]  Cheng Yeaw Ku,et al.  Intersecting Families in the Alternating Group and Direct Product of Symmetric Groups , 2007, Electron. J. Comb..

[16]  Rudolf Ahlswede,et al.  The Complete Intersection Theorem for Systems of Finite Sets , 1997, Eur. J. Comb..

[17]  D. E. Daykin,et al.  The Number of Values of a Boolean Function , 1976 .

[18]  Rudolf Ahlswede,et al.  A Pushing-Pulling Method: New Proofs of Intersection Theorems , 1999, Comb..

[19]  Richard M. Wilson,et al.  The exact bound in the Erdös-Ko-Rado theorem , 1984, Comb..

[20]  Rudolf Ahlswede,et al.  The Intersection Theorem for Direct Products , 1998, European journal of combinatorics (Print).

[21]  Cheng Yeaw Ku,et al.  Erdos-Ko-Rado theorems for permutations and set partitions , 2008, J. Comb. Theory, Ser. A.

[22]  Péter L. Erdös,et al.  A Group-Theoretic Setting for Some Intersecting Sperner Families , 1992, Comb. Probab. Comput..

[23]  Gyula O. H. Katona,et al.  Intersection theorems for systems of finite sets , 1964 .

[24]  D. Kleitman.  On a combinatorial conjecture of Erdös , 1966 .

[25]  Claudia Malvenuto,et al.  Stable sets of maximal size in Kneser-type graphs , 2004, Eur. J. Comb..

[26]  J. Marica,et al.  Differences of Sets and A Problem of Graham , 1969, Canadian Mathematical Bulletin.

[27]  Jun Wang,et al.  Erdös-Ko-Rado-Type Theorems for Colored Sets , 2007, Electron. J. Comb..

[28]  László A. Székely,et al.  On Intersecting Chains in Boolean Algebras , 1994, Comb. Probab. Comput..

[29]  A Sperner-type theorem for families of finite sets , 1978 .

[30]  Norihide Tokushige.  EKR type inequalities for 4-wise intersecting families , 2007, J. Comb. Theory, Ser. A.

[31]  Jun Wang,et al.  An Erdös-Ko-Rado-type theorem in Coxeter groups , 2008, Eur. J. Comb..

[32]  Rudolf Ahlswede,et al.  The Complete Nontrivial-Intersection Theorem for Systems of Finite Sets , 1996, J. Comb. Theory, Ser. A.

[33]  Zoltán Füredi,et al.  The Erdös-Ko-Rado Theorem for Integer Sequences , 1980, SIAM J. Matrix Anal. Appl..

[34]  Cheng Yeaw Ku,et al.  Intersecting families of permutations , 2003, Eur. J. Comb..

[35]  József Balogh,et al.  A new short proof of a theorem of Ahlswede and Khachatrian , 2008, J. Comb. Theory, Ser. A.

[36]  R. Ahlswede.  Advances on Extremal Problems in Number Theory and Combinatorics , 2001 .

[37]  P. Frankel,et al.  An Erdos-Ko-Rado theorem for direct products , 1996 .

[38]  Rudolf Ahlswede,et al.  Katona’s Intersection Theorem: Four Proofs , 2004, Comb..

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

[40]  Bruce Rothschild,et al.  A Generalization of the Erdös-Ko-Rado Theorem on Finite Set Systems , 1973, J. Comb. Theory, Ser. A.

[41]  John M. Talbot.  The number of k-intersections of an intersecting family of r-sets , 2004, J. Comb. Theory, Ser. A.

[42]  László A. Székely,et al.  Towards a Katona Type Proof for the 2-intersecting Erdos-Ko-Rado Theorem , 2001, Electron. J. Comb..

[43]  Norihide Tokushige.  The maximum size of 3-wise t-intersecting families , 2007, Eur. J. Comb..

[44]  Norihide Tokushige,et al.  The Erdős–Ko–Rado Theorem for Integer Sequences , 1999, Comb..

[45]  D. Kleitman.  Families of Non-disjoint subsets* , 1966 .

[46]  Fan Chung Graham,et al.  Some intersection theorems for ordered sets and graphs , 1986, J. Comb. Theory, Ser. A.

[47]  Cheng Yeaw Ku,et al.  An Erd˝s-Ko-Rado theorem for partial permutations , 2006, Discret. Math..

[48]  R. C. Bose,et al.  Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture , 1960, Canadian Journal of Mathematics.

[49]  M. L Livingston.  An Ordered Version of the Erdös-Ko-Rado Theorem , 1979, J. Comb. Theory, Ser. A.

[50]  Lucia Moura,et al.  Erdos-Ko-Rado theorems for uniform set-partition systems , 2005, Electron. J. Comb..

[51]  Dennis Stanton,et al.  Some Erdös-Ko-Rado Theorems for Chevalley Groups , 1980, SIAM J. Algebraic Discret. Methods.

[52]  Peter Frankl,et al.  On intersecting families of finite sets , 1978, Bulletin of the Australian Mathematical Society.

[53]  Peter Borg.  Intersecting and Cross-Intersecting Families of Labeled Sets , 2008, Electron. J. Comb..