New approach to the k-independence number of a graph
Let G = (V,E) be a graph and k > 0 an integer. A k-independent set S V is a set of vertices such that the maximum degree in the graph induced by S is at most k. With 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...
| Autores: | , |
|---|---|
| Formato: | artículo |
| Fecha de publicación: | 2013 |
| País: | España |
| Recursos: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/18603 |
| Acesso em linha: | https://hdl.handle.net/2117/18603 |
| Access Level: | acceso abierto |
| Palavra-chave: | Average degree K-independence Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Combinatòria |
| Resumo: | Let G = (V,E) be a graph and k > 0 an integer. A k-independent set S V is a set of vertices such that the maximum degree in the graph induced by S is at most k. With 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, k(G) > k+1 dde+k+1n, 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]. |
|---|