6 search results - page 2 / 2 » Tripartite Ramsey numbers for paths |
176
click to vote
DAM
2007
15 years 6 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 ...