Name
Abstract | ||
|---|---|---|
We show for k >= 2 that if q >= 3 and n >= 2k + 1, or q = 2 and n >= 2k + 2, then any intersecting family F of k-subspaces of an n-dimensional vector space over GF(q) with boolean AND(F is an element of F) F=0 has size at most [n-1 k-1] - q(k(k-1)) [n-k-1 k-1] + q(k). This bound is sharp as is shown by Hilton-Milner type families. As an application of this result, we determine the chromatic number of the corresponding q-Kneser graphs. |
Year | Venue | Keywords |
|---|---|---|
2010 | ELECTRONIC JOURNAL OF COMBINATORICS | vector space |
Field | DocType | Volume |
Discrete mathematics,Graph,Vector space,Combinatorics,Mathematics | Journal | 17.0 |
Issue | ISSN | Citations |
1.0 | 1077-8926 | 21 |
PageRank | References | Authors |
1.31 | 9 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| A. Blokhuis | 1 | 272 | 62.73 |
| A. E. Brouwer | 2 | 21 | 1.31 |
| A. Chowdhury | 3 | 21 | 1.31 |
| Peter Frankl | 4 | 54 | 4.37 |
| T. Mussche | 5 | 21 | 1.31 |
| Balázs Patkós | 6 | 85 | 21.60 |
| T. Sz | 7 | 21 | 1.31 |