Section 11.3 Estimating Ramsey Numbers
We will find it convenient to utilize the following approximation due to Stirling. You can find a proof in almost any advanced calculus book.
Of course, we will normally be satisfied with the first term:
Using Stirling's approximation and the binomial coefficients from the proof of Ramsey's Theorem for Graphs, we have the following upper bound: