New Approach to the k-Independence Number of a Graph

Let $G = (V,E)$ be a graph and $k \ge 0$ an integer. A $k$-independent set $S \subseteq V$ is a set of vertices such that the maximum degree in the graph induced by $S$ is at most $k$. With $\alpha_k(G)$ we denote the maximum cardinality of a $k$-independent set of $G$. We prove that, for a graph $G$ on $n$ vertices and average degree $d$, $\alpha_k(G) \ge \frac{k+1}{\lceil d \rceil + k + 1} n$, improving the hitherto best general lower bound due to Caro and Tuza [Improved lower bounds on $k$-independence, J. Graph Theory 15 (1991), 99-107].

[1]  Paul A. Catlin.  Graph Decompositions Satisfying Extremal Degree Constraints , 1978, J. Graph Theory.

[2]  László Lovász.  On decomposition of graphs , 1966 .

[3]  B. Bollobás,et al.  Extremal Graph Theory , 2013 .

[4]  Alexandr V. Kostochka,et al.  Variable degeneracy: extensions of Brooks' and Gallai's theorems , 2000, Discret. Math..

[5]  Dieter Rautenbach,et al.  Independence in connected graphs , 2011, Discret. Appl. Math..

[6]  Michael A. Henning,et al.  Extremal results on defective colorings of graphs , 1994, Discret. Math..

[7]  Noga Alon,et al.  Large induced degenerate subgraphs , 1987, Graphs Comb..

[8]  Douglas R. Woodall,et al.  Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency , 1986, J. Graph Theory.

[9]  Jerrold R. Griggs.  Lower bounds on the independence number in terms of the degrees , 1983, J. Comb. Theory, Ser. B.

[10]  Béla Bollobás,et al.  Optimal Vertex Partitions , 1979 .

[11]  Yair Caro,et al.  Partitions of graphs into small and large sets , 2012, Discret. Appl. Math..

[12]  Torsten Thiele.  A lower bound on the independence number of arbitrary hypergraphs , 1999, J. Graph Theory.

[13]  James B. Shearer.  A note on the independence number of triangle-free graphs, II , 1991, J. Comb. Theory, Ser. B.

[14]  Hoong Chuin Lau,et al.  Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and Coloring , 1997, J. Graph Algorithms Appl..

[15]  Aravind Srinivasan,et al.  Finding Large Independent Sets in Graphs and Hypergraphs , 2005, SIAM J. Discret. Math..

[16]  James B. Shearer,et al.  A note on the independence number of triangle-free graphs , 1983, Discret. Math..

[17]  Jochen Harant,et al.  A lower bound on the independence number of a graph in terms of degrees , 2006, Discuss. Math. Graph Theory.

[18]  Jean-Sébastien Sereni,et al.  Improper coloring of unit disk graphs , 2009, Networks.

[19]  Odile Favaron,et al.  Maximal k-independent sets in graphs , 2008, Discuss. Math. Graph Theory.

[20]  Dieter Rautenbach,et al.  On F-independence in graphs , 2009, Discuss. Math. Graph Theory.

[21]  A. R. Rao,et al.  An extremal problem in graph theory , 1968, Journal of the Australian Mathematical Society.

[22]  Owen Murphy,et al.  Lower bounds on the stability number of graphs computed in terms of degrees , 1991, Discret. Math..

[23]  Siemion Fajtlowicz,et al.  On conjectures of Graffiti , 1988, Discret. Math..

[24]  Stanley M. Selkow.  A Probabilistic lower bound on the independence number of graphs , 1994, Discret. Math..

[25]  Odile Favaron,et al.  On the residue of a graph , 1991, J. Graph Theory.

[26]  Zsolt Tuza,et al.  Improved lower bounds on k-independence , 1991, J. Graph Theory.

[27]  Odile Favaron,et al.  k-Domination and k-Independence in Graphs: A Survey , 2012, Graphs Comb..

[28]  Jochen Harant,et al.  On the independence number of a graph in terms of order and size , 2001, Discret. Math..

[29]  Elena Losievskaja,et al.  Approximation algorithms for independent set problems on hypergraphs , 2009 .

[30]  Ali Shokoufandeh,et al.  A note on the Caro-Tuza bound on the independence number of uniform hypergraphs , 2012, Australas. J Comb..

[31]  Dieter Rautenbach,et al.  The potential of greed for independence , 2012, J. Graph Theory.

[32]  Yusheng Li,et al.  Differential Methods for Finding Independent Sets in Hypergraphs , 2006, SIAM J. Discret. Math..

[33]  Frank Jelen,et al.  k-Independence and the k-residue of a graph , 1999, J. Graph Theory.

[35]  Jean-Claude Bermond,et al.  Improper Coloring of Weighted Grid and Hexagonal Graphs , 2010, Discret. Math. Algorithms Appl..

[36]  Paul A. Catlin,et al.  Another bound on the chromatic number of a graph , 1978, Discret. Math..

[37]  N. Alon,et al.  The Probabilistic Method, Second Edition , 2000 .

[38]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[39]  János Komlós,et al.  A Note on Ramsey Numbers , 1980, J. Comb. Theory, Ser. A.