Abstract
For a given graph H, the Ramsey number r(H) is the minimum N such that any 2-edge-coloring of the complete graph K-N yields a monochromatic copy of H.......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
