The Ramsey Numbers R(K3,Kq-e)
WANG Qingxian
(Department of Computer, Information Engineering Institute,Zhengzhou,450002)
WANG Gongben
(Branch Campus of Peking University,Beijing,100083)
YAN Shuda
(Department of Mathematics, Peking University,Beijing,100871)
- Abstract:
- The Ramsey number n=R(G,H) has been defined as the minimum n such that every 2-coloring (red and green) of the edges of the complete graph Kn has a red subgraph G, or a green subgraph H.By constructing cyclic colorings systematically with the help of a microcomputer, it is proved that
R(K3,K11-e)>=42, R(K3,K13-e)>=54,
R(K3,K14-e)>=59,
R(K3,K15-e)>=69.
- Key words:
- Ramsey number; lower bound; cyclic coloring
(R.D.1997-03-25 P.D.1998-01-20 Vol.34 No.1 pp.15-20)
To Total contents......
To Contents(Mathematics)