Bandwidth of graphs resulting from the edge clique covering problem

Konrad Engel, Sebastian Hanisch

Let $n,k,b$ be integers with $1\le k-1\le b\le n$ and let $G_{n,k,b}$ be the graph whose vertices are the $k$-element subsets $X$ of $\{0,\dots ,n\}$ with $\max (X)-\min (X)\le b$…