Journal article
Graphs with arbitrary Ramsey number and connectivity
- Abstract:
- The Ramsey number r(G) of a graph G is the minimum number N such that any red-blue colouring of the edges of KN contains a monochromatic copy of G. Pavez-Signé, Piga and Sanhueza-Matamala proved that for any function n ≤ f(n) ≤ r(Kn), there is a sequence of connected graphs (Gn)n∈N with |V(Gn)| = n such that r(Gn) = Θ(f(n)) and conjectured that Gn can additionally have arbitrarily large connectivity. In this note we prove their conjecture.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Version of record, pdf, 242.3KB, Terms of use)
-
- Publisher copy:
- 10.37236/12547
Authors
+ Engineering and Physical Sciences Research Council
More from this funder
- Funder identifier:
- https://ror.org/0439y7842
- Funding agency for:
- Scott, A
- Grant:
- EP/X013642/1
- Publisher:
- Electronic Journal of Combinatorics
- Journal:
- The Electronic Journal of Combinatorics More from this journal
- Volume:
- 31
- Issue:
- 4
- Article number:
- P4.76
- Publication date:
- 2024-12-27
- Acceptance date:
- 2024-11-20
- DOI:
- EISSN:
-
1077-8926
- ISSN:
-
1097-1440
- Language:
-
English
- Pubs id:
-
2081813
- Local pid:
-
pubs:2081813
- Deposit date:
-
2025-03-28
- ARK identifier:
Terms of use
- Copyright holder:
- Ahme and Scott
- Copyright date:
- 2024
- Rights statement:
- © The authors. Released under the CC BY-ND license (International 4.0).
If you are the owner of this record, you can report an update to it here: Report update to this record