Abstract
We present explicit constructions of three families of graphs that yield the following lower bounds on Ramsey numbers: R(4,m)>Ω(m8/5), R(5,m)>Ω(m5/3), R(6,m)>Ω(m2).
Original language | English (US) |
---|---|
Pages (from-to) | 439-445 |
Number of pages | 7 |
Journal | Journal of Combinatorial Theory. Series B |
Volume | 100 |
Issue number | 5 |
DOIs | |
State | Published - Sep 2010 |
Keywords
- Explicit constructions
- Lower bounds
- Ramsey numbers
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics