Independent sets near the lower bound in bounded degree graphs

@inproceedings{Dvok2017IndependentSN,
  title={Independent sets near the lower bound in bounded degree graphs},
  author={Zdeněk Dvoř{\'a}k and Bernard Lidick{\'y}},
  booktitle={STACS},
  year={2017}
}
By Brook's 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). 

Figures from this paper

Maximum independent sets near the upper bound

References

SHOWING 1-10 OF 49 REFERENCES
On the Independence Number of Graphs with Maximum Degree 3
TLDR
A linear-time kernelization algorithm for the independent set problem on graphs with maximum degree at most 3 that computes a kernel of size at most 140 k/47<3k, where k is the given parameter and improves the known 3k upper bound on the kernel size for the problem.
Large Independent Sets in Triangle-Free Planar Graphs
TLDR
An algorithm is given that, given a triangle-free planar graph G on n vertices and an integer k ≥ 0, decides whether G has an independent set of size at least (n + k)/3, in time \(2^{O(\sqrt{k}n\).
A new proof of the independence ratio of triangle-free cubic graphs
Large Independent Sets in Subquartic Planar Graphs
TLDR
A well-known open question in the field of Parameterized Complexity asks whether the problem of finding a maximum independent set in a given planar graph is fixed-parameter tractable, for parameter the “gain” over this tight lower bound.
Some Ramsey-type numbers and the independence ratio
If each of k, m, and n is a positive integer, there is a smallest positive integer r = rk(m, n) with the property that each graph G with at least r vertices, and with maximum degree not exceeding k,
Quickly Excluding a Planar Graph
TLDR
A much better bound is proved on the tree-width of planar graphs with no minor isomorphic to a g × g grid and this is the best known bound.
Subcubic triangle‐free graphs have fractional chromatic number at most 14/5
We prove that every subcubic triangle‐free graph has fractional chromatic number at most 14/5 , thus confirming a conjecture of Heckman and Thomas [Discrete Math. 233 (2001) 233–237].
Every Planar Map Is Four Colorable
As has become standard, the four color map problem will be considered in the dual sense as the problem of whether the vertices of every planar graph (without loops) can be colored with at most four
A Fractional Analogue of Brooks' Theorem
TLDR
A fractional analogue of Brooks' theorem is proved: If a connected graph G with $\ Delta(G)\geq 4$ is not one of the graphs listed above, then the authors have $\chi_f(G))\leq \Delta(G)- \frac{2}{67}$.
Parameterized Complexity
TLDR
An approach to complexity theory which offers a means of analysing algorithms in terms of their tractability, and introduces readers to new classes of algorithms which may be analysed more precisely than was the case until now.
...
...