activity
20122026
most citedA new family of tight sets in

40 citations · 48 across the 17 of their papers we have counts for

collaborators

20 papers

math.CO2026

A note on the chromatic number of Kneser graphs on chambers of projective planes and incidence-free sets

Philipp Heering, Klaus Metsch, Vladislav Taranchuk +1

Let be a symmetric -design and let be an equinumerous incidence-free pair, with and …

math.CO2025

A Completion Result for Partial Affine and Inversive Spaces

Cassie Grace, Klaus Metsch, Geertrui Van de Voorde

A partial affine plane of order is a point-line incidence structure with points and points on each line, such that every two lines meet in at most one point. In this…

math.CO2025

The largest sets of non-opposite chambers in spherical buildings of type

Jan De Beule, Philipp Heering, Sam Mattheus +1

The investigation into large families of non-opposite flags in finite spherical buildings has been a recent addition to a long line of research in extremal combinatorics, extending…

math.CO2024

An algebraic approach to Erdős-Ko-Rado sets of flags in spherical buildings II

Jan De Beule, Sam Mattheus, Klaus Metsch

We continue our investigation of Erdős-Ko-Rado (EKR) sets of flags in spherical buildings. In previous work, we used the theory of buildings and Iwahori-Hecke algebras to obtain up…

math.CO2024

Maximum Erdős-Ko-Rado sets of chambers and their antidesigns in vector-spaces of even dimension

Philipp Heering, Jesse Lansdown, Klaus Metsch

A chamber of the vector space is a set of subspaces of where and $\dim(S_i)…

math.CO2023

Maximal cocliques and the chromatic number of the Kneser graph on chambers of PG

Philipp Heering, Klaus Metsch

Let be the graph whose vertices are the chambers of the finite projective -space PG, with two vertices being adjacent if and only if the corresponding chambers are in…