Cocliques in the Kneser graph on $(n-1,n)$-flags of PG$(2n,q)$

TL;DR

This paper determines the largest independent sets in a graph formed by certain flags in finite projective space, confirming a conjecture and providing stability results for large q.

Contribution

It establishes the maximum cocliques in the Kneser graph on flags of PG(2n,q) for large q, confirming a conjecture and extending Erdős–Ko–Rado type results.

Findings

Largest cocliques characterized for large q

Confirmed conjecture of D'haeseleer, Metsch, and Werner

Provided stability results for the cocliques

Abstract

In the finite projective space PG$(2n,q)$ we consider flags of type $(n-1,n)$, that is, pairs $(A,B)$ consisting of an $(n-1)$-space $A$ and an $n$-space $B$ that are incident. Two such flags $(A_1,B_1)$ and $(A_2,B_2)$ are opposite if $A_1\cap B_2=A_2\cap B_1=\emptyset$. Let $\Gamma_{2n}$ be the graph whose vertices are the flags of type $(n-1,n)$ of PG$(2n,q)$, with two vertices being adjacent if the corresponding flags are opposite. Using the Erd\H{o}s-Matching theorem for vector spaces shown by Ihringer, we determine, for $q$ large enough, the largest cocliques of $\Gamma_{2n}$ and obtain a stability result. This EKR-type theorem proves a conjecture of D'haeseleer, Metsch and Werner.