The independence number of graphs with large odd girth

zbMath0814.05045MaRDI QIDQ1346728

Tristan Denley

Publication date: 6 April 1995

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/118588

zbMATH Keywords

independence numberlower boundgirthregular graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (7)

Lower Bounds for On-line Graph Colorings ⋮ Lower bounds on the independence number of certain graphs of odd girth at least seven ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes ⋮ Independence, odd girth, and average degree ⋮ On finding augmenting graphs ⋮ Online coloring graphs with high girth and high odd girth

This page was built for publication: The independence number of graphs with large odd girth