New approach to the \(k\)-independence number of a graph

zbMath1266.05110arXiv1208.4734MaRDI QIDQ1953418

Adriana Hansberg, Yair Caro

Publication date: 7 June 2013

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1208.4734

zbMATH Keywords

average degree\(k\)-independence

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (22)

Transversals and independence in linear hypergraphs with maximum degree two ⋮ Mixed domination and 2-independence in trees ⋮ Isolation in graphs ⋮ Conjecture of TxGraffiti: Independence, domination, and matchings ⋮ On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence ⋮ On vertex independence number of uniform hypergraphs ⋮ The k‐path vertex cover: General bounds and chordal graphs ⋮ New results on \(k\)-independence of hypergraphs ⋮ Thresholds for the monochromatic clique transversal game ⋮ On \(k\)-domination and \(j\)-independence in graphs ⋮ Partitions of graphs into small and large sets ⋮ Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs ⋮ Upper bounds on the \(k\)-forcing number of a graph ⋮ Simultaneous domination in graphs ⋮ Independent sets in graphs ⋮ Partial domination - the isolation number of a graph ⋮ New results on \(k\)-independence of graphs ⋮ Multiple Domination ⋮ MAX for \(k\)-independence in multigraphs ⋮ On the \(k\)-independence number of graphs ⋮ Regular independent sets ⋮ Lower bounds for the independence and \(k\)-independence number of graphs using the concept of degenerate degrees

This page was built for publication: New approach to the \(k\)-independence number of a graph