Abstract
The size Ramsey number (r) over cap (G, H) of two graphs G, H, introduced by Erdos et al., is defined as (r) over cap (G, H) = min{|E(F)| : F -> (G......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
