Combinatorial Theory of a Complete Graph K5
Geetha N. K · IOSR Journal of Mathematics · 2014
For two given graphs G and H, the Ramsey number R(G,H) is the positive integer N such that for every graph F of order N, either F contains G as a subgraph.The Ramsey number R(F Ɩ , K 4 ) where F Ɩ is the graph of every triangle.The aim of this paper is to prove that R(F Ɩ , K n ) = 2Ɩ(n-1) + 1 for n=4 & Ɩ = 3 and R(F Ɩ , K n ) = 2Ɩ(n-1) + 1 for Ɩ ≥ n ≥ 5.