关于完全t部图的色等价性(英文)

On the Chromatic Equivalence of Complete T-partite Graphs

设K（n1，n2，…，nt）表示完全t部图，K(n1，n2，…，nt）－A表示从K（n1，n2，…，nt）中删去子边集A所得之图．本文证明了：令G＝K（n1，n2，…，nt），J为整数集，R为实数集．设简单图Y满足Y～G，则且进一步有：若s＞0且αi∈R（i＝1，2…．t）．

Let K(n1, n2,…, nt) denote the complete t-partite graph and K(n1, n2,…, nt) - A denote the t-partite graph obtained by deleting a edge subset A from the graph K(n1, n2,…, nt). In this paper we prove that:Let C = K(n1, n2,…, nt) (for t≥3),J be the integer set and R be the real number set. Suppose that a graph Y satisfoes Y ~ C, then where ,and ni + ai > 0, i= 1,2,…,t.Furthermore, if s > 0 and for i = 1,2,…, t, then