Cocliques in the Kneser graph on line-plane flags in \(\mathrm{PG}(4, Q)\)

DOI10.1007/s00493-016-3438-2zbMath1399.05120OpenAlexW2466850915MaRDI QIDQ722306

Andries E. Brouwer, Aart Blokhuis

Publication date: 23 July 2018

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-016-3438-2

zbMATH Keywords

extremal problemscliquesindependent setscombinatorial structures in finite projective spaces

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Extremal set theory (05D05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial structures in finite projective spaces (51E20)

Related Items

An algebraic approach to Erdős-Ko-Rado sets of flags in spherical buildings, An EKR-theorem for finite buildings of type \(D_{\ell }\), The unique coclique extension property for apartments of buildings, On the chromatic number of some generalized Kneser graphs, The chromatic number of two families of generalized Kneser graphs related to finite generalized quadrangles and finite projective 3-spaces, Maximal cocliques in the Kneser graph on plane-solid flags in \(\mathrm{PG}(6,q)\), On the chromatic number of two generalized Kneser graphs

Cites Work

• Cocliques in the Kneser graph on the point-hyperplane flags of a projective space
• The Erdős-Ko-Rado theorem for vector spaces
• Maximal cocliques in the Kneser graph on point-plane flags in \(\mathrm{PG}(4,q)\)
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS