Abstract
Given an integer r >= 1 and graphs G, H-1, ..., H-r, we write G -> (H-1, ..., H-r) if every r-coloring of the edges of G contains a monochromati......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
