The independence number of graphs with a forbidden cycle and Ramsey numbers
From MaRDI portal
Publication:1768585
DOI10.1023/B:JOCO.0000017383.13275.17zbMath1060.05070OpenAlexW2061124349MaRDI QIDQ1768585
Publication date: 15 March 2005
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:joco.0000017383.13275.17
Generalized Ramsey theory (05C55) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (12)
A note on multicolor Ramsey number of small odd cycles versus a large clique ⋮ New upper bound for multicolor Ramsey number of odd cycles ⋮ The independence numbers of weighted graphs with forbidden cycles ⋮ Maximum cuts of graphs with forbidden cycles ⋮ Ramsey numbers of some bipartite graphs versus complete graphs ⋮ Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers ⋮ Lower bounds for independence numbers of some locally sparse graphs ⋮ Two results on Ramsey-Turán theory ⋮ The early evolution of the \(H\)-free process ⋮ The multi-color Ramsey number of an odd cycle ⋮ Ramsey numbers involving an odd cycle and large complete graphs in three colors ⋮ Randomly finding independent sets in locally sparse graphs
This page was built for publication: The independence number of graphs with a forbidden cycle and Ramsey numbers
