Locally Dense Independent Sets in Regular Graphs of Large Girth—An Example of a New Approach

DOI10.1007/978-3-540-76796-1_8zbMath1359.05091OpenAlexW22977650MaRDI QIDQ2971608

Dieter Rautenbach, Frank Göring, Ingo Schiermeyer, Jochen Harant

Publication date: 7 April 2017

Published in: Research Trends in Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-76796-1_8

Mathematics Subject Classification ID

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

Related Items (3)

Lower bounds on the independence number of certain graphs of odd girth at least seven ⋮ Dynamic monopolies for degree proportional thresholds in connected graphs of girth at least five and trees ⋮ Interpolating between bounds on the independence number

Cites Work

• A note on the independence number of triangle-free graphs. II
• Differential equations for random processes and random graphs
• Large independent sets in regular graphs of large girth
• Girth and Independence Ratio
• The Independence Ratio of Regular Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Locally Dense Independent Sets in Regular Graphs of Large Girth—An Example of a New Approach