14 citations · 59 across the 29 of their papers we have counts for
Showing 2009 · math.COShow all
2 papers · 2 filters
math.CO2009★ 2 cited
Independence Complexes of Stable Kneser Graphs
Benjamin Braun
For integers n\geq 1, k\geq 0, the stable Kneser graph SG_{n,k} (also called the Schrijver graph) has as vertex set the stable n-subsets of [2n+k] and as edges disjoint pairs of n-…
math.CO2009
Nowhere-Harmonic Colorings of Graphs
Matthias Beck, Benjamin Braun
Proper vertex colorings of a graph are related to its boundary map, also called its signed vertex-edge incidence matrix. The vertex Laplacian of a graph, a natural extension of the…