The cycle-complete graph Ramsey number \(r(C_{9}, K_{8})\) (Q643174)
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 cycle-complete graph Ramsey number r(C₉, K₈) |
scientific article; zbMATH DE number 5964874
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The cycle-complete graph Ramsey number \(r(C_{9}, K_{8})\) |
scientific article; zbMATH DE number 5964874 |
Statements
The cycle-complete graph Ramsey number \(r(C_{9}, K_{8})\) (English)
0 references
28 October 2011
0 references
Summary: It has been conjectured by \textit{P. Erdős} et al. [J. Graph Theory 2, 53--64 (1978; Zbl 0383.05027)] that \(r(C_m, K_n) = (m - 1)(n - 1) + 1\) for all \((m, n) \neq (3, 3)\) satisfying that \(m \geq n \geq 3\) (except \(r(C_3, K_3) = 6\)). In this paper, we prove this for the case \(m = 9\) and \(n = 8\).
0 references
Ramsey number
0 references
0 references
0.9385973215103148
0 references
0.9139384627342224
0 references
0.9055646061897278
0 references
0.8939091563224792
0 references
0.8920291662216187
0 references
