Name
Abstract | ||
|---|---|---|
Let m,n, and k be integers satisfying 0 < k <= n < 2k <= m. A family of sets F is called an (m,n,k)-intersecting family if (([n])(k)) subset of F subset of (([m])(k)) and any pair of members of F have nonempty intersection. Maximum (m,k,k)- and (m,k+1,k)-intersecting families are determined by the theorems of Erdos-Ko-Rado and Hilton-Milner, respectively. We determine the maximum families for the cases n = 2k - 1, 2k - 2, 2k - 3, and m sufficiently large. |
Year | Venue | Keywords |
|---|---|---|
2013 | ELECTRONIC JOURNAL OF COMBINATORICS | intersecting family,cross-intersecting family,Erdos-Ko-Rado,Milner-Hilton,Kneser graph |
DocType | Volume | Issue |
Journal | 20.0 | 3.0 |
ISSN | Citations | PageRank |
1077-8926 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wei-Tian Li | 1 | 36 | 3.82 |
| Bor-Liang Chen | 2 | 143 | 20.64 |
| Kuo-Ching Huang | 3 | 32 | 5.56 |
| Ko-wei Lih | 4 | 529 | 58.80 |