Author

Philipp Heering

0 works0 citationsORCID

Recent research

  • AI & ComputingOpen access

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

    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 $Γ_...

    Journal of Combinatorial Theory Series A2026-10-070 citationsDOI