Interpolating between bounds on the independence number

DOI10.1016/j.disc.2010.05.026zbMath1213.05042OpenAlexW2001698828MaRDI QIDQ708394

Dieter Rautenbach, Anett Boßecker

Publication date: 11 October 2010

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

Full work available at URL: https://www.db-thueringen.de/servlets/MCRFileNodeServlet/dbt_derivate_00018227/IfM_Preprint_M09_26.pdf

zbMATH Keywords

independencetriangle-free graph

Mathematics Subject Classification ID

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

Related Items (1)

New analytical lower bounds on the clique number of a graph

Cites Work

• Unnamed Item
• An upper bound on the Ramsey numbers R(3,k)
• A note on the independence number of triangle-free graphs
• A note on Ramsey numbers
• A dense infinite Sidon sequence
• On Turan's theorem for sparse graphs
• A note on the independence number of triangle-free graphs. II
• Independent sets in graphs with triangles
• Clique is hard to approximate within \(n^{1-\epsilon}\)
• 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
• Paths in graphs
• On the independence number of sparse graphs

This page was built for publication: Interpolating between bounds on the independence number