The Ramsey numbers \(R(C_m,K_7)\) and \(R(C_7,K_8)\) (Q925037)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Ramsey numbers R(C_m,K₇) and R(C₇,K₈) |
scientific article; zbMATH DE number 5280772
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Ramsey numbers \(R(C_m,K_7)\) and \(R(C_7,K_8)\) |
scientific article; zbMATH DE number 5280772 |
Statements
The Ramsey numbers \(R(C_m,K_7)\) and \(R(C_7,K_8)\) (English)
0 references
29 May 2008
0 references
The Ramsey number \(R(G_1,G_2)\) is the smallest integer \(n\) such that for any \(G\) of order \(n\) either \(G\) contains \(G_1\) or the complement of \(G\) contains \(G_2\). In the paper it is shown that \(R(C_m,K_7) = 6m-5\) for \(m \geq 7\) and \(R(C_7,K_8) = 43\). These results confirm the conjecture of \textit{P. Erdős}, \textit{R.J. Faudree}, \textit{C.C. Rousseau}, and \textit{R.H. Schelp} [J. Graph Theory 2, 53--64 (1978; Zbl 0383.05027)].
0 references
Ramsey number
0 references
cycle
0 references
complete graph
0 references
0 references
0.9243342876434326
0 references
0.9060907363891602
0 references
0.8993439674377441
0 references
0.8860791325569153
0 references
0.8834608197212219
0 references
