Abstract
We determine the independence number of the Kneser graph on line-plane flags in the projective space PG(4;q). We also classify the corresponding maximum-size cocliques.
Similar content being viewed by others
References
A. Blokhuis, A. E. Brouwer and Ç. Güven: Cocliques in the Kneser graph on the point-hyperplane flags, Combinatorica 34 (2013), 1–10.
A. Blokhuis, A. E. Brouwer and T. Szőnyi: Maximal cocliques in the Kneser graph on point-plane flags in PG(4;q), European Journal of Combinatorics 35 (2014), 95–104.
P. Erdős, C. Ko and R. Rado: Intersection theorems for systems of finite sets, Quart. J. Math. Oxford Ser. 12 (1961), 313–320.
P. Frankl and R. M. Wilson: The Erdős-Ko-Rado theorem for vector spaces, J. Combin. Theory (A) 43 (1986), 228–236.
Author information
Authors and Affiliations
Corresponding author
Additional information
The first author acknowledges support from ERC grant DISCRETECONT 227701 and OTKA Grant K 81310.
Rights and permissions
About this article
Cite this article
Blokhuis, A., Brouwer, A.E. Cocliques in the Kneser graph on line-plane flags in PG(4;q). Combinatorica 37, 795–804 (2017). https://doi.org/10.1007/s00493-016-3438-2
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00493-016-3438-2