Abstract
The famous Erdos-Gallai theorem on the Turan number of paths states that every graph with n vertices and m edges contains a path with at least (2m)/n ......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
