## The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities.(English)Zbl 1408.05132

Summary: In this paper we give a framework for applying Katona’s cycle proof of the Erdős-Ko-Rado theorem to other objects. We also show how this method can be realized as a result using homomorphisms of graphs.

### MathOverflow Questions:

What is the independence number of hamming graph?

### MSC:

 05D05 Extremal set theory 05A05 Permutations, words, matrices

MathOverflow
Full Text:

### References:

 [1] Ahlswede, R; Khachatrian, LH, The complete intersection theorem for systems of finite sets, Eur. J. Comb., 18, 125-136, (1997) · Zbl 0869.05066 [2] Ahlswede, R; Khachatrian, LH, The diametric theorem in Hamming spaces-optimal anticodes, Adv. Appl. Math., 20, 429-449, (1998) · Zbl 0909.05044 [3] Albertson, MO; Collins, KL, Homomorphisms of $$3$$-chromatic graphs, Discrete Math., 54, 127-132, (1985) · Zbl 0572.05024 [4] Berge, C, Nombres de coloration de l’hypergraphe $$h$$-parti complet, Lecture Notes Math., 411, 13-20, (1974) · Zbl 0295.05130 [5] Bollobás, B; Leader, I, An Erdős-ko-Rado theorem for signed sets, Comput. Math. Appl., 34, 9-13, (1997) · Zbl 0901.05088 [6] Borg, P, On $$t$$-intersecting families of signed sets and permutations, Discrete Math., 309, 3310-3317, (2009) · Zbl 1216.05003 [7] Borg, P, Cross-intersecting families of partial permutations, SIAM J. Discrete Math., 24, 600-608, (2010) · Zbl 1236.05199 [8] Borg, P, A Hilton-milner-type theorem and an intersection conjecture for signed sets, Discrete Math., 313, 1805-1815, (2013) · Zbl 1277.05158 [9] Borg, P; Leader, I, Multiple cross-intersecting families of signed sets, J. Comb. Theory Ser. A, 117, 583-588, (2010) · Zbl 1216.05163 [10] Borg, P; Meagher, K, Intersecting generalised permutations, Australas. J. Comb., 61, 147-155, (2015) · Zbl 1309.05005 [11] Brouwer, AE; Godsil, CD; Koolen, JH; Martin, WJ, Width and dual width of subsets in polynomial association schemes, J. Comb. Theory Ser. A, 102, 255-271, (2003) · Zbl 1018.05108 [12] Brunk, F; Huczynska, S, Some Erdős-ko-Rado theorems for injections, Eur. J. Comb., 31, 839-860, (2010) · Zbl 1226.05004 [13] Cameron, PJ; Ku, CY, Intersecting families of permutations, Eur. J. Comb., 24, 881-890, (2003) · Zbl 1026.05001 [14] Daykin, DE, Erdős-ko-Rado from Kruskal-katona, J. Comb. Theory Ser. A, 17, 254-255, (1974) · Zbl 0287.05005 [15] Deza, M; Frankl, P, Erdős-ko-Rado theorem-$$22$$ years later, SIAM J. Algebraic Discrete Methods, 4, 419-431, (1983) · Zbl 0526.05001 [16] Dyck, A; Meagher, K, An Erdős-ko-Rado theorem for subset partitions, Involve, 8, 119-127, (2015) · Zbl 1309.05176 [17] Engel, K, An Erdős-ko-Rado theorem for the subcubes of a cube, Combinatorica, 4, 133-140, (1984) · Zbl 0557.05008 [18] Erdős, P; Faigle, U; Kern, W, A group-theoretic setting for some intersecting sperner families, Comb. Probab. Comput., 1, 323-334, (1992) · Zbl 0793.05137 [19] Erdős, P; Ko, C; Rado, R, Intersection theorems for systems of finite sets, Quart. J. Math. Oxford Ser. (2), 12, 313-320, (1961) · Zbl 0100.01902 [20] Frankl, P.: The Erdős-Ko-Rado theorem is true for $$n=ckt$$. In: Combinatorics. Colloq. Math. Soc. János Bolyai, vol. 18, pp. 365-375. North-Holland, Amsterdam (1978) · Zbl 0401.05001 [21] Frankl, P; Füredi, Z, The Erdős-ko-Rado theorem for integer sequences, SIAM J. Algebraic Discrete Methods, 1, 376-381, (1980) · Zbl 0506.05001 [22] Frankl, P; Füredi, Z, A new short proof of the EKR theorem, J. Comb. Theory Ser. A, 119, 1388-1390, (2012) · Zbl 1244.05008 [23] Frankl, P; Graham, RL, Old and new proofs of the Erdős-ko-Rado theorem, Sichuan Daxue Xuebao, 26, 11-122, (1989) · Zbl 0716.05039 [24] Füredi, Z., Hwang, K-W., Weichsel, P.M.: A proof and generalizations of the Erdős-Ko-Rado theorem using the method of linearly independent polynomials. In: Topics in Discrete Mathematics, vol. 26, pp. 215-224. Springer, Berlin (2006) · Zbl 1115.05090 [25] Godsil, C. D.: What is the independence number of Hamming graph? MathOverFlow. http://mathoverflow.net/questions/141842/what-is-the-independence-number-of-hamming-graph/ (2013) · Zbl 0572.05024 [26] Godsil, C.D.: Algebraic Combinatorics. Chapman and Hall Mathematics Series. Chapman & Hall, New York (1993) [27] Godsil, C., Meagher, K.: The Erdős-Ko-Rado Theorems: Algebraic Approaches. Cambridge University Press, Cambridge (2016) · Zbl 1343.05002 [28] Howard, R., Károlyi, G., Székely, L.: Towards a Katona type proof for the 2-intersecting Erdős-Ko-Rado theorem. Electron. J. Combin. 8(1): Research Paper 31, pp. 8 (2001) · Zbl 1309.05176 [29] Kamat, V., Misra, N.: An Erdős-Ko-Rado theorem for matchings in the complete graph. In: The Seventh European Conference on Combinatorics, Graph Theory and Applications of CRM Series 16, 613 (2013) · Zbl 1291.05159 [30] Katona, G, Intersection theorems for systems of finite sets, Acta Math. Acad. Sci. Hungar, 15, 329-337, (1964) · Zbl 0134.25101 [31] Katona, GOH, A simple proof of the Erdős-chao ko-Rado theorem, J. Comb. Theory Ser. B, 13, 183-184, (1972) · Zbl 0262.05002 [32] Katona, G.O.H.: The cycle method and its limits. Numbers, information and complexity (Bielefeld, 1998), pp. 129-141. Kluwer Acad. Publ, Boston, MA (2000) · Zbl 0948.05054 [33] Ku, CY; Leader, I, An Erdős-ko-Rado theorem for partial permutations, Discrete Math., 306, 74-86, (2006) · Zbl 1088.05072 [34] Larose, B; Malvenuto, C, Stable sets of maximal size in Kneser-type graphs, Eur. J. Comb., 25, 657-673, (2004) · Zbl 1048.05078 [35] Li, Y-S, A katona-type proof for intersecting families of permutations, Int. J. Contemp. Math. Sci., 3, 1261-1268, (2008) · Zbl 1202.05144 [36] Li, Y-S., Wang, J.: Erdős-Ko-Rado-type theorems for colored sets. Electron. J. Combin., 14, Research Paper 1, p. 9 (2007) · Zbl 1111.05094 [37] Mahdian, Mohammad: Private Communication, (2010) [38] Moon, A, An analogue of the Erdős-ko-Rado theorem for the Hamming schemes $$H(n,\, q)$$, J. Comb. Theory Ser. A., 32, 386-390, (1982) · Zbl 0483.05002 [39] Swenson, J.: A probabilistic proof of the Erdős-Ko-Rado theorem. (2011). https://jmswen.wordpress.com/2011/06/05/a-probabilistic-proof-of-the-erdos-ko-rado-theorem/ · Zbl 1236.05199 [40] Suda, S, A generalization of the Erdős-ko-Rado theorem to $$t$$-designs in certain semilattices, Discrete Math., 312, 1827-1831, (2012) · Zbl 1242.05033 [41] van Lint, J.H., Wilson, R.M.: A Course in Combinatorics, 2nd edn. Cambridge University Press, Cambridge (2001) · Zbl 0980.05001 [42] Wang, J; Zhang, H, Nontrivial independent sets of bipartite graphs and cross-intersecting families, J. Comb. Theory Ser. A., 120, 129-141, (2013) · Zbl 1253.05112 [43] Wilson, RM, The exact bound in the Erdős-ko-Rado theorem, Combinatorica, 4, 247-257, (1984) · Zbl 0556.05039 [44] Zhu, X, Circular perfect graphs, J. Graph Theory, 48, 186-209, (2005) · Zbl 1071.05037
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.