A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
We prove that for a large family of product graphs, and for Kneser graphs K(n, αn) with fixed α < 1/2, the following holds. Any set of vertices that spans a small proportion of the edges in the graph can be made independent by removing a small proportion of the vertices of the graph. This allows us to strengthen the results of  and , and show that any independent set in these graphs is almost contained in an independent set which depends on few coordinates. Our proof is inspired by, anddoi:10.19086/da.3103 fatcat:otcjyje3yfguvf7rzvzs32gx3i