A new lower bound on the independence number of a graph and applications
From MaRDI portal
Publication:405126
zbMath1300.05226MaRDI QIDQ405126
Michael A. Henning, Christian Löwenstein, Anders Yeo, Justin Southey
Publication date: 4 September 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i1p38
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)
Related Items (14)
Transversals and independence in linear hypergraphs with maximum degree two ⋮ A lower bound on the independence number of a graph in terms of degrees and local clique sizes ⋮ New bounds on the independence number of connected graphs ⋮ Conjecture of TxGraffiti: Independence, domination, and matchings ⋮ On vertex independence number of uniform hypergraphs ⋮ A note on Reed's conjecture for triangle-free graphs ⋮ The Tuza–Vestergaard Theorem ⋮ Some bounds on the size of maximum G-free sets in graphs ⋮ Packing in regular graphs ⋮ An improved lower bound on the independence number of a graph ⋮ Perfect roman domination in regular graphs ⋮ Bounds on the independence number of a graph in terms of order, size and maximum degree ⋮ A new upper bound on the total domination number in graphs with minimum degree six ⋮ Zero forcing in claw-free cubic graphs
Cites Work
- Unnamed Item
- Matchings and transversals in hypergraphs, domination and independence in trees
- Total domination of graphs and small transversals of hypergraphs
- Independence, clique size and maximum degree
- Small transversals in hypergraphs
- An upper bound for the transversal numbers of 4-uniform hypergraphs
- Hypergraphs with large transversal number and with edge sizes at least 3
- Domination in partitioned graphs
This page was built for publication: A new lower bound on the independence number of a graph and applications
