On cycle—Complete graph ramsey numbers
From MaRDI portal
Publication:4163559
DOI10.1002/jgt.3190020107zbMath0383.05027OpenAlexW2166333600WikidataQ105941655 ScholiaQ105941655MaRDI QIDQ4163559
Richard H. Schelp, Ralph J. Faudree, Cecil C. Rousseau, Paul Erdős
Publication date: 1978
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190020107
Related Items
A note on multicolor Ramsey number of small odd cycles versus a large clique, The independence numbers of weighted graphs with forbidden cycles, A class of edge critical 4-chromatic graphs, Ramsey goodness of paths, Ramsey Size Linear Graphs, Multicolor star-critical Ramsey numbers and Ramsey-good graphs, The Ramsey numbers for a cycle of length six or seven versus a clique of order seven, Exact values of multicolor Ramsey numbers \(R_l(C_{\le l+1})\), The Ramsey numbers of two sets of cycles, A note on the Ramsey number of stars -- complete graphs, Generalised Ramsey numbers for two sets of cycles, Unnamed Item, Orthonormal representations of \(H\)-free graphs, The cycle-complete graph Ramsey number \(r(C_{9}, K_{8})\), Ramsey Goodness of Cycles, The Ramsey numbers \(R(C_m,K_7)\) and \(R(C_7,K_8)\), 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, Compact topological minors in graphs, Ramsey-goodness -- and otherwise, Pancyclicity of Hamiltonian and highly connected graphs, The Ramsey number for a cycle of length five vs. a complete graph of order six, The Ramsey number for a cycle of length six versus a clique of order eight, A degree sequence variant of graph Ramsey numbers, The Ramsey number \(R(C_8,K_8)\), Ramsey-type theorems, Randomly finding independent sets in locally sparse graphs
Cites Work
