The confirmation of a conjecture on disjoint cycles in a graph

In this paper, we prove the following conjecture proposed by Gould, Hirohata and Keller [Discrete Math. submitted]: Let $G$ be a graph of sufficiently large order. If $\sigma_t(G) \geq 2kt - t + 1$ for any two integers $k \geq 2$ and $t \geq 5$, then $G$ contains $k$ disjoint cycles.

Saved in:
Bibliographic Details
Main Authors Ma, Fuhong, Yan, Jin
Format Journal Article
LanguageEnglish
Published 07.07.2017
Subjects
Mathematics - Combinatorics
Online AccessGet full text

Cover

More Information
Summary:In this paper, we prove the following conjecture proposed by Gould, Hirohata and Keller [Discrete Math. submitted]: Let $G$ be a graph of sufficiently large order. If $\sigma_t(G) \geq 2kt - t + 1$ for any two integers $k \geq 2$ and $t \geq 5$, then $G$ contains $k$ disjoint cycles.
DOI:10.48550/arxiv.1707.02390