A note on odd cycle-complete graph Ramsey numbers (Q5954316)
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 1699541
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on odd cycle-complete graph Ramsey numbers |
scientific article; zbMATH DE number 1699541 |
Statements
A note on odd cycle-complete graph Ramsey numbers (English)
0 references
7 February 2002
0 references
Summary: The Ramsey number \(r(C_l, K_n)\) is the smallest positive integer \(m\) such that every graph of order \(m\) contains either a cycle of length \(l\) or a set of \(n\) independent vertices. In this short note we slightly improve the best known upper bound on \(r(C_l, K_n)\) for odd \(l\).
0 references
Ramsey number
0 references
0.8234061002731323
0 references
0.8227201104164124
0 references
0.8162752985954285
0 references
0.810195803642273
0 references
0.8078785538673401
0 references
