Lower bounds on the independence number of certain graphs of odd girth at least seven

DOI10.1016/J.DAM.2010.10.011zbMath1203.05121OpenAlexW1978042415WikidataQ114191534 ScholiaQ114191534MaRDI QIDQ617649

Anders Sune Pedersen, Friedrich Regen, Dieter Rautenbach

Publication date: 21 January 2011

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

Full work available at URL: https://doi.org/10.1016/j.dam.2010.10.011

zbMATH Keywords

independencestabilityodd girth

Mathematics Subject Classification ID

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

Related Items (4)

New bounds on the independence number of connected graphs ⋮ An improved lower bound on the independence number of a graph ⋮ Adjacency eigenvalues of graphs without short odd cycles ⋮ Bounds on the independence number of a graph in terms of order, size and maximum degree

Cites Work

• Unnamed Item
• A note on the independence number of triangle-free graphs. II
• Some simplified NP-complete graph problems
• The independence number of dense graphs with large odd girth
• The independence number of graphs with large odd girth
• Large independent sets in regular graphs of large girth
• Locally Dense Independent Sets in Regular Graphs of Large Girth—An Example of a New Approach
• Independence, odd girth, and average degree
• Some Ramsey-Type Numbers and the Independence Ratio
• Size and independence in triangle‐free graphs with maximum degree three
• A new proof of the independence ratio of triangle-free cubic graphs

This page was built for publication: Lower bounds on the independence number of certain graphs of odd girth at least seven