165
click to vote
GC
2011
Springer
14 years 6 months 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,...
JCT
1998
14 years 10 months ago
1998
For k > 2 and r ≥ 2, let G(k, r) denote the smallest positive integer g such that every increasing sequence of g integers {a1, a2, . . . , ag} with gaps aj+1 − aj ∈ {1, ....
DAM
2007
14 years 11 months ago
2007
For two given graphs F and H, the Ramsey number R(F, H) is the smallest positive integer p such that for every graph G on p vertices the following holds: either G contains F as a ...
EJC
2008
14 years 11 months ago
2008
For two given graphs G1 and G2, the Ramsey number R(G1, G2) is the smallest positive integer n such that for any graph G of order n, either G contains G1 or the complement of G co...