Graph TheoryHardExtremal Graph Theory and Ramsey Theory ShareExtremal Graph Theory and Ramsey Theory · Hard problemThe recursion gives the closed bound R(s,t)≤(s+t−2s−1)R(s,t)\le\binom{s+t-2}{s-1}R(s,t)≤(s−1s+t−2). What does it give for R(4,5)R(4,5)R(4,5)?Check Show answer Walk through it step by step Practice more like this Review this concept