Abstract
For a finite family of fixed graphs let R-k(F) be the smallest integer n for which every k-coloring of the edges of the complete graph K-n yields a mo......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
