Graph TheoryMediumExtremal Graph Theory and Ramsey Theory ShareExtremal Graph Theory and Ramsey Theory · Medium problemUsing R(2,4)=4R(2,4)=4R(2,4)=4, R(3,3)=6R(3,3)=6R(3,3)=6 and the recursion R(s,t)≤R(s−1,t)+R(s,t−1)R(s,t)\le R(s-1,t)+R(s,t-1)R(s,t)≤R(s−1,t)+R(s,t−1), what upper bound do you get for R(3,4)R(3,4)R(3,4)?Check Show answer Walk through it step by step Practice more like this Review this concept