摘要
设G1，…，Gt（t≥2）是单图，均衡Ramsey数B（G1，…，Gt）定义为最小正整数n，使得对于每个N≥n和完全图KN的每个均衡t一边染色KN＝H1……Ht（均衡染色指Hi和Hj的边数之差至多为1，1≤i≤j≤t），存在至少一个i，1≤i≤t，图Gi是Hi的子图，本文对某些图得到了均衡Ramsey数。
Let G_1,G_2…,G_t(t≥2) be simple grapns. Balanced Ramsey number B (G_1,G_2,…, G_t) is defined to be the least positive integer n such that for every N≥n and every balanced t-edge colouring of K_N. K_N=H_1H_2…H_t (that is, the difference between the numbers of edges of H_i and H_j is a t most one, 1≤i<j≤t), the graph G_i is a subgraph of H_i for some i, 1≤i≤t. In this paper, balanced Ramsey numbers for some graphs are obtained. For example,let, k≥3 is odd, t is divided by 3 and every G_i (2≤i≤t) contains either K_1,k or K_3, then B(K_1,k, G_2…, G_t) =t(k-1)+2
基金
福建省自然科学基金
