Abstract
Let G = (V, E) be a graph of density p on n vertices. Following Erdos, Luczak, and Spencer, an m-vertex subgraph H of G is called full if H has minimu......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
