Abstract
We determine the maximum number of induced copies of a 5-cycle in a graph on n $n$ vertices for every n $n$. Every extremal construction is a balanced......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
