科研之友
微信
新浪微博
Facebook
分享链接
摘要
For a bipartite graph the extremal number for the existence of a specific odd (even) length path was determined in J. Graph Theory 8 (1984), 83-95. In this article, we conjecture that for a balanced bipartite graph with partite sets of odd order the extremal number for an even order path guarantees many more paths of differing lengths. The conjecture is proved for a linear portion of the conjectured paths.
- 出版日期2014-7
