Author:
Cockayne E. J.,Lorimer P. J.
Abstract
If G1,…,Gc are graphs without loops or multiple edges there is a smallest integer r(G1,…,Gc) such that if the edges of a complete graph Kn, with n ≧ r(G1,…,Gc), are painted arbitrarily with c colours the ith coloured subgraph contains Gi as a subgraph for at least one i. r(G1,…Gc) is called the Ramsey number of the graphs G1,…,Gc.
Publisher
Cambridge University Press (CUP)
Cited by
47 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献