7 search results - page 1 / 2 » Three-color Ramsey numbers for paths |
GC
2011
Springer
13 years 17 days ago
2011
Springer
The Ramsey number r(H, Kn) is the smallest positive integer N such that every graph of order N contains either a copy of H or an independent set of size n. The Tur´an number ex(m,...
DMTCS
2008
13 years 5 months ago
2008
JGT
2007
13 years 5 months ago
2007
COMBINATORICA
2008
13 years 4 months ago
2008
GC
2011
Springer
13 years 17 days ago
2011
Springer
The smallest n such that every colouring of the edges of Kn must contain a monochromatic star K1,s+1 or a properly edge-coloured Kt is denoted by f(s, t). Its existence is guarant...