On the maximum degree of induced subgraphs of the Kneser graph

Hou Tin Chau, David Ellis, Ehud Friedgut +1

For integers $n\ge k\ge 1$, the {\em Kneser graph} $K(n,k)$ is the graph with vertex-set consisting of all the $k$-element subsets of $\{1,2,\dots ,n\}$, where two $k$-element…