科研之友
微信
新浪微博
Facebook
分享链接
摘要
We prove that there exists a bivariate function f with f (k, l) = O(l . k log k) such that for every natural k and l, every graph G has at least k vertex-disjoint cycles of length at least l or a set of at most f (k, l) vertices that meets all cycles of length at least l. This improves a result by Birmele et al. (Combinatorica, 27 (2007), 135-145), who proved the same result with f (k, l) = Theta(l . k(2)).
- 出版日期2014-9
