New lower bounds on independence number in triangle-free graphs in terms of order, maximum degree and girth

DOI10.1016/j.disc.2014.06.001zbMath1298.05256OpenAlexW2058982600MaRDI QIDQ400363

Nicolas Lichiardopol

Publication date: 21 August 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2014.06.001

zbMATH Keywords

independence numbergirthmaximum degree

Mathematics Subject Classification ID

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

Related Items (2)

Improved FPT algorithms for weighted independent set in bull-free graphs ⋮ An invariant for minimum triangle-free graphs

Cites Work

• A note on the independence number of triangle-free graphs. II
• Large independent sets in regular graphs of large girth
• Some Ramsey-Type Numbers and the Independence Ratio
• Girth and Independence Ratio

This page was built for publication: New lower bounds on independence number in triangle-free graphs in terms of order, maximum degree and girth