Abstract
For two given graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer N such that, for any graph G of order N, either G contains G1 as a subgraph or the complement of G contains G2 as a subgraph. A fan Fl is l triangles sharing exactly one vertex. In this note, it is shown that R(Fn, Fm) = 4n + 1 for n ≥ max{m
2 − m/2, 11m/2 − 4}.
Original language | English |
---|---|
Pages (from-to) | 19-23 |
Number of pages | 5 |
Journal | Bulletin of the Australian Mathematical Society |
Volume | 92 |
Issue number | 1 |
DOIs | |
Publication status | Published - Aug 2015 |
Keywords
- MSC-05C
- Ramsey number
- Fan
- 2024 OA procedure