On Ramsey numbers of fans (Q1003775)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5523227
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Ramsey numbers of fans |
scientific article; zbMATH DE number 5523227 |
Statements
On Ramsey numbers of fans (English)
0 references
4 March 2009
0 references
The graph \(F_n = K_1 + nK_2\) is the Fan graph, and consists of \(n\) triangles sharing a single vertex. It was shown in [\textit{Y. Li} and \textit{C.C. Rousseau}, J. Graph Theory 23, No.\,4, 413--420 (1996; Zbl 0954.05031)] that the Ramsey number \(r(F_1, F_n) = 4n + 1\) for \(n \geq 2\), and this result is extended by showing that \(r(F_2, F_n) = 4n + 1\) also for \(n \geq 2\). In addition, the general upper bound \(r(F_s, F_n) \leq 4n + 2s\) for \(2 \leq s \leq n\) is proved.
0 references
Ramsey Number
0 references
Fan graph
0 references
Goodness
0 references
0.919626235961914
0 references
0.8919032216072083
0 references
0.8716870546340942
0 references
0.8712072372436523
0 references
