Browse > Article
http://dx.doi.org/10.4134/BKMS.b160334

AN ERDŐS-KO-RADO THEOREM FOR MINIMAL COVERS  

Ku, Cheng Yeaw (Department of Mathematics National University of Singapore)
Wong, Kok Bin (Institute of Mathematical Sciences University of Malaya)
Publication Information
Bulletin of the Korean Mathematical Society / v.54, no.3, 2017 , pp. 875-894 More about this Journal
Abstract
Let $[n]=\{1,2,{\ldots},n\}$. A set ${\mathbf{A}}=\{A_1,A_2,{\ldots},A_l\}$ is a minimal cover of [n] if ${\cup}_{1{\leq}i{\leq}l}A_i=[n]$ and $$\bigcup_{{1{\leq}i{\leq}l,}\\{i{\neq}j_0}}A_i{\neq}[n]\text{ for all }j_0{\in}[l]$$. Let ${\mathcal{C}}(n)$ denote the collection of all minimal covers of [n], and write $C_n={\mid}{\mathcal{C}}(n){\mid}$. Let ${\mathbf{A}}{\in}{\mathcal{C}}(n)$. An element $u{\in}[n]$ is critical in ${\mathbf{A}}$ if it appears exactly once in ${\mathbf{A}}$. Two minimal covers ${\mathbf{A}},{\mathbf{B}}{\in}{\mathcal{C}}(n)$ are said to be restricted t-intersecting if they share at least t sets each containing an element which is critical in both ${\mathbf{A}}$ and ${\mathbf{B}}$. A family ${\mathcal{A}}{\subseteq}{\mathcal{C}}(n)$ is said to be restricted t-intersecting if every pair of distinct elements in ${\mathcal{A}}$ are restricted t-intersecting. In this paper, we prove that there exists a constant $n_0=n_0(t)$ depending on t, such that for all $n{\geq}n_0$, if ${\mathcal{A}}{\subseteq}{\mathcal{C}}(n)$ is restricted t-intersecting, then ${\mid}{\mathcal{A}}{\mid}{\leq}{\mathcal{C}}_{n-t}$. Moreover, the bound is attained if and only if ${\mathcal{A}}$ is isomorphic to the family ${\mathcal{D}}_0(t)$ consisting of all minimal covers which contain the singleton parts $\{1\},{\ldots},\{t\}$. A similar result also holds for restricted r-cross intersecting families of minimal covers.
Keywords
t-intersecting family; $Erd{\ddot{o}}s-Ko-Rado$; set partitions;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 C. Y. Ku and K. B. Wong, A Deza-Frankl type theorem for set partitions, Electron. J. Combin. 22 (2015), no. 1, Paper 1.84, 11 pp.
2 P. Frankl and R. M. Wilson, The Erdos-Ko-Rado theorem for vector spaces, J. Combin. Theory Ser. A 43 (1986), no. 2, 228-236.   DOI
3 C. Y. Ku and K. B. Wong, An Analogue of the Hilton-Milner Theorem for weak compositions, Bull. Korean Math. Soc. 52 (2015), no. 3, 1007-1025.   DOI
4 C. Y. Ku and K. B. Wong, On r-cross t-intersecting families for weak compositions, Discrete Math. 338 (2015), no. 7, 1090-1095.   DOI
5 R. Ahlswede and L. H. Khachatrian, The complete intersection theorem for systems of finite sets, European J. Combin. 18 (1997), no. 2, 125-136.   DOI
6 R. Ahlswede and L. H. Khachatrian, The diametric theorem in Hamming spaces - Optimal anticodes, Adv. in Appl. Math. 20 (1998), no. 4, 429-449.   DOI
7 M. Matsumoto and N. Tokushige, The exact bound in the Erdos-Ko-Rado theorem for cross-intersecting families, J. Combin. Theory Ser. A 52 (1989), no. 1, 90-97.   DOI
8 C. Y. Ku and K. B. Wong, A non-trivial intersection theorem for permutations with fixed number of cycles, Discrete Math. 339 (2016), no. 2, 646-657.   DOI
9 C. Y. Ku and K. B. Wong, An intersecting theorem for integer sequence, preprint.
10 C. Y. Ku and T. W. H. Wong, Intersecting families in the alternating group and direct product of symmetric groups, Electron. J. Combin. 14 (2007), no. 1, Research Paper 25, 15 pp.
11 A. Moon, An analogue of the Erdos-Ko-Rado theorem for the Hamming schemes H(n, q), J. Combin. Theory Ser. A 32 (1982), no. 3, 386-390.   DOI
12 R. M. Wilson, The exact bound in the Erdos-Ko-Rado theorem, Combinatorica 4 (1984), no. 2-3, 247-257.   DOI
13 C. Bey, On cross-intersecting families of sets, Graphs Combin. 21 (2005), no. 2, 161-168.   DOI
14 L. Pyber, A new generalization of the Erdos-Ko-Rado theorem, J. Combin. Theory Ser. A 43 (1986), no. 1, 85-90.   DOI
15 N. Tokushige, A product version of the Erdos-Ko-Rado theorem, J. Combin. Theory Ser. A 118 (2011), no. 5, 1575-1587.   DOI
16 J. Wang and H. Zhang, Cross-intersecting families and primitivity of symmetric systems, J. Combin. Theory Ser. A 118 (2011), no. 2, 455-462.   DOI
17 J. Wang and S. J. Zhang, An Erdos-Ko-Rado-type theorem in Coxeter groups, European J. Combin. 29 (2008), no. 5, 1112-1115.   DOI
18 P. J. Cameron and C. Y. Ku, Intersecting families of permutations, European J. Combin. 24 (2003), no. 7, 881-890.   DOI
19 P. Borg, The maximum sum and the maximum product of sizes of cross-intersecting families, European J. Combin. 35 (2014), 117-130.   DOI
20 F. Brunk and S. Huczynska, Some Erdos-Ko-Rado theorems for injections, European J. Combin. 31 (2010), no. 3, 839-860.   DOI
21 A. Chowdhury and B. Patkos, Shadows and intersections in vector spaces, J. Combin. Theory Ser. A 117 (2010), no. 8, 1095-1106.   DOI
22 D. Ellis, Stability for t-intersecting families of permutations, J. Combin. Theory Ser. A 118 (2011), no. 1, 208-227.   DOI
23 D. Ellis, Forbidding just one intersection, for permutations, J. Combin. Theory Ser. A 126 (2014), 136-165.   DOI
24 D. Ellis, E. Friedgut, and H. Pilpel, Intersecting families of permutations, J. Amer. Math. Soc. 24 (2011), no. 3, 649-682.   DOI
25 P. Erdos, C. Ko, and R. Rado, Intersection theorems for systems of finite sets, Quart. J. Math. Oxford Ser. (2) 12 (1961), 313-318.   DOI
26 P. Frankl, On intersecting families of finite sets, J. Combin. Theory Ser. A 24 (1978), no. 2, 146-161.   DOI
27 P. Frankl, The Erdos-Ko-Rado theorem is true for n = ckt, Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), Vol. I, pp. 365-375, Colloq. Math. Soc. Jnos Bolyai, 18, North-Holland, Amsterdam-New York, 1978.
28 P. Frankl and Z. Furedi, Nontrivial intersecting families, J. Combin. Theory Ser. A 41 (1986), no. 1, 150-153.   DOI
29 P. Frankl and N. Tokushige, On r-cross intersecting families of sets, Combin. Probab. Comput. 20 (2011), no. 5, 749-752.   DOI
30 P. Frankl, S. J. Lee, M. Siggers, and N. Tokushige, An Erdos-Ko-Rado theorem for cross t-intersecting families, J. Combin. Theory Ser. A 128 (2014), 207-249.   DOI
31 C. Y. Ku and K. B. Wong, On cross-intersecting families of set partitions, Electron. J. Combin. 19 (2012), no. 4, Paper 49, 9 pp.
32 C. Godsil and K. Meagher, A new proof of the Erdos-Ko-Rado theorem for intersecting families of permutations, European J. Combin. 30 (2009), no. 2, 404-414.   DOI
33 C. Y. Ku and I. Leader, An Erdos-Ko-Rado theorem for partial permutations, Discrete Math. 306 (2006), no. 1, 74-86.   DOI
34 C. Y. Ku and D. Renshaw, Erdos-Ko-Rado theorems for permutations and set partitions, J. Combin. Theory Ser. A 115 (2008), no. 6, 1008-1020.   DOI
35 C. Y. Ku and K. B. Wong, An analogue of Hilton-Milner theorem for set partitions, J. Combin. Theory Ser. A 120 (2013), no. 7, 1508-1520.   DOI
36 C. Y. Ku and K. B. Wong, An analogue of the Erdos-Ko-Rado theorem for weak compositions, Discrete Math. 313 (2013), no. 21, 2463-2468.   DOI
37 C. Y. Ku and K. B. Wong, On r-cross intersecting families of sets, Far East J. Math. Sci. 75 (2013), 295-300.
38 C. Y. Ku and K. B. Wong, An Erdos-Ko-Rado theorem for permutations with fixed number of cycles, Electron. J. Combin. 21 (2014), no. 3, Paper 3.16, 9 pp.