The independence number of dense graphs with large odd girth
From MaRDI portal
Publication:1344960
zbMath0811.05032MaRDI QIDQ1344960
Publication date: 21 February 1995
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/118567
Related Items (9)
The independence numbers of weighted graphs with forbidden cycles ⋮ Lower bounds on the independence number of certain graphs of odd girth at least seven ⋮ The maximum spectral radius of \(\{C_3, C_5\}\)-free graphs of given size ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Lower bounds for independence numbers of some locally sparse graphs ⋮ Independence, odd girth, and average degree ⋮ Adjacency eigenvalues of graphs without short odd cycles ⋮ The critical window for the classical Ramsey-Turán problem ⋮ The Erdős-Hajnal conjecture for three colors and triangles
This page was built for publication: The independence number of dense graphs with large odd girth