Extremal problems concerning Kneser graphs

Abstract Let A and B be two intersecting families of k-subsets of an n-element set. It is proven that | A ∪ B | ≤ (k−1n−1) + (k−1n−1) holds for n> 1 2 (3+ 5 )k , and equality holds only if there exist two points a, b such that {a, b} ∩ F ≠ ∅ for all F ∈ A ∪ B . For n = 2k + o( k ) an example showing that in this case max | A ∪ B | = (1−o(1))(kn) is given. This disproves an old conjecture of Erdos [7]. In the second part we deal with several generalizations of Kneser's conjecture.

[1]  Imre Bárány,et al.  A Short Proof of Kneser's Conjecture , 1978, J. Comb. Theory, Ser. A.

[2]  P. Os,et al.  Problems and Results in Combinatorial Analysis , 1978 .

[3]  Peter Frankl.  On intersecting families of finite sets , 1980, Bulletin of the Australian Mathematical Society.

[4]  László Lovász,et al.  Kneser's Conjecture, Chromatic Number, and Homotopy , 1978, J. Comb. Theory A.

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

[6]  Noga Alon,et al.  The chromatic number of kneser hypergraphs , 1986 .

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

[8]  David S. Johnson,et al.  The Complexity of Near-Optimal Graph Coloring , 1976, J. ACM.

[9]  L. Lovász.  Combinatorial problems and exercises , 1979 .

[10]  D. E. Daykin,et al.  SETS OF INDEPENDENT EDGES OF A HYPERGRAPH , 1976 .

[11]  E. J. Cockayne,et al.  The Ramsey number for stripes , 1975 .

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

[13]  Peter Frankl,et al.  On the chromatic number of the general Kneser-graph , 1985, J. Graph Theory.

[14]  Miklós Simonovits,et al.  Supersaturated graphs and hypergraphs , 1983, Comb..

[15]  David S. Johnson,et al.  Two Results Concerning Multicoloring , 1978 .

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

[17]  P. Erdos.  A PROBLEM ON INDEPENDENT r-TUPLES , 1965 .

[18]  Dennis P. Geller,et al.  The chromatic number and other functions of the lexicographic product , 1975 .

[19]  Imre Bárány,et al.  On a Topological Generalization of a Theorem of Tverberg , 1981 .

[20]  Alfréd Rényi,et al.  Probability Theory , 1970 .

[21]  R. A. Cuninghame-Green,et al.  Packing and Covering in Combinatorics , 1980 .

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

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

[24]  S. Stahl.  n-Tuple colorings and associated graphs , 1976 .

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