Bart Sevenster

activity

20152018

most citedOn the circular chromatic number of a subgraph of the Kneser graph

3 citations · 5 across the 4 of their papers we have counts for

collaborators

Showing 2018Show all

2 papers · 1 filter

math.CO2018

Mixed partition functions and exponentially bounded edge-connection rank

Guus Regts, Bart Sevenster

We study graph parameters whose associated edge-connection matrices have exponentially bounded rank growth. Our main result is an explicit construction of a large class of graph pa…

math.CO2018★ 3 cited

On the circular chromatic number of a subgraph of the Kneser graph

Bart Litjens, Sven Polak, Bart Sevenster +1

Let $n, k, r$ be positive integers with $n \geq r k$ and $r \geq 2$ . Consider a circle $C$ with~ $n$ points~ $1, \dots, n$ in clockwise order. The $r$ -stable \emph{interlacing graph} $\t…