Independent Sets near the Lower Bound in Bounded Degree Graphs
Authors
Publication date
1 January 2017
Publisher
LIPIcs - Leibniz International Proceedings in Informatics. 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)
Doi
Abstract
By Brook\u27s Theorem, every n-vertex graph of maximum degree at most Delta >= 3 and clique number at most Delta is Delta-colorable, and thus it has an independent set of size at least n/Delta. We give an approximate characterization of graphs with independence number close to this bound, and use it to show that the problem of deciding whether such a graph has an independent set of size at least n/Delta+k has a kernel of size O(k)
