边Ramsey数上界研究

On upper bounds for some size Ramsey numbers

对于无向有限简单图G和H,边Ramsey数R(G,H)是指最小的整数e,使得对一个有e条边的图的边用红蓝两色进行2-染色后要么得到一个红色的G,要么得到一个蓝色的H。通过分支定界法,得到一些边Ramsey数的上界。

For undirected simple graph G and H, the size Ramsey number R（G,H） is the smallest integer e, so that every graph of e edges with red and blue of the 2-coloring result in either a copy of Red G, or g a copy of blue H. Using a branch and bound algorithm, some upper bounds for size Ramsey numbers are obtained.