2 citations · 3 across the 5 of their papers we have counts for
10 papers · 1 filter
On the Chromatic Number of some generalized Kneser Graphs
Jozefien D'haeseleer, Klaus Metsch, Daniel Werner
We determine the chromatic number of the Kneser graph qΓ_{7,{3,4}} of flags of vectorial type {3, 4} of a rank 7 vector space over the finite field GF(q) for large q and describe t…
On the treewidth of generalized Kneser graphs
Klaus Metsch
The generalized Kneser graph for integers and is the graph whose vertices are the -subsets of with two vertices adjacent if and only…
Erdös-Ko-Rado sets of flags of finite sets
Klaus Metsch
A flag of a finite set is a set of non-empty proper subsets of such that or for all . The set is called the typ…
The chromatic number of a two families of generalized Kneser graphs related to finite generalized quadrangles and finite projective 3-spaces
Klaus Metsch
Let be the graph whose vertices are the chambers of the finite projective space with two vertices being adjacent when the corresponding chambers are in general positi…
An algebraic approach to Erdős-Ko-Rado sets of flags in spherical buildings
Jan De Beule, Klaus Metsch, Sam Mattheus
In this paper, oppositeness in spherical buildings is used to define an EKR-problem for flags in projective and polar spaces. A novel application of the theory of buildings and Iwa…
On the chromatic number of two generalized Kneser graphs
Jozefien D'haeseleer, Klaus Metsch, Daniel Werner
We determine the chromatic number of some graphs of flags in buildings of type , namely of the Kneser graphs of flags of type in the vector spaces for $q\g…