Eighty Years of RamseyR(3, k)…and Counting!
How frequently does an intriguing problem come up over lunchtime, only to have it solved the next morning? How many mathematical problems are seemingly intractable? Decades go by without a hint of progress. What a delight when a problem is worked on over many many years with progress occurring incrementally until it finally succumbs.
- N. Alon and J. Spencer,The Probabilistic Method, 3rd ed., Wiley, New York (2008), 50 (1989), pp.305–307.Google Scholar
- P. Erdős, Graph theory and probability II.,Can. J. Math. 13 (1961), 346–352.Google Scholar
- P. Erdős and L. Lovász, Problems and results on 3-chromatic hypergraphs and some related questions, inInfinite and Finite Sets (A. Hajnal et al., eds.), North-Holland, Amsterdam (1975), pp. 609–628.Google Scholar
- S. Radziszowski, Small Ramsey numbers,Electron J. Combin., DS1, http://www.combinatorics.org/Surveys, 12 revisions, (1994–2009), 72 pages.