On 2-Edge-Chromatic Graph K _(35) (3,9)

Let K n be the complete graph of order n. If red and blue are assigned to the edges of K n such that there is neither subgraph K 3 whose edges are all red or subgraph K p whose edges are all blue,then a color graph obtained from K n by such 2 edge coloring is denoted by K n(3,p). The maximum value of n for K n(3,p) is written as R(3,p), obviously R(3,p)=r(3,p)-1, where r(3,p) is the Ramsey number.We give a construction of a K 35 (3,9) from K 26 (3,8). As a result,we get R(3,9)35 and r(3,9)36.