| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4657347 | Journal of Combinatorial Theory, Series B | 2008 | 9 Pages |
Abstract
For constant r and arbitrary n, it was known that in the graph any independent set of size close to the maximum is close to some independent set of maximum size. We prove that this statement holds for arbitrary r and n.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
