# On the Number of Vertex-Disjoint Cycles in Digraphs

@article{Bai2019OnTN,
title={On the Number of Vertex-Disjoint Cycles in Digraphs},
author={Y. Bai and Y. Manoussakis},
journal={SIAM J. Discret. Math.},
year={2019},
volume={33},
pages={2444-2451}
}
• Published 2019
• Mathematics, Computer Science
• SIAM J. Discret. Math.
Let $k$ be a positive integer. Bermond and Thomassen conjectured in 1981 that every digraph with minimum outdegree at least $2k-1$ contains $k$ vertex-disjoint cycles. It is famous as one of the one hundred unsolved problems selected in [Bondy, Murty, Graph Theory, Springer-Verlag London, 2008]. Lichiardopol, Por and Sereni proved in [SIAM J. Discrete Math. 23 (2) (2009) 979-992] that the above conjecture holds for $k=3$. Let $g$ be the girth, i.e., the length of the shortest cycle, of a given… Expand

#### References

SHOWING 1-10 OF 18 REFERENCES
Vertex-disjoint cycles in bipartite tournaments
• Mathematics, Computer Science
• Electron. Notes Discret. Math.
• 2016
• 2
• PDF
A Step toward the Bermond--Thomassen Conjecture about Disjoint Cycles in Digraphs
• Mathematics, Computer Science
• SIAM J. Discret. Math.
• 2009
• 27
• Highly Influential
• PDF
Vertex Disjoint Cycles of Different Length in Digraphs
• Mathematics, Computer Science
• SIAM J. Discret. Math.
• 2012
• 12
Disjoint 3-Cycles in Tournaments: A Proof of The Bermond-Thomassen Conjecture for Tournaments
• Mathematics, Computer Science
• J. Graph Theory
• 2014
• 18
• Highly Influential
• PDF
Vertex-disjoint directed and undirected cycles in general digraphs
• Computer Science, Mathematics
• J. Comb. Theory, Ser. B
• 2014
• 8
• PDF
Disjoint cycles in digraphs
• 63
• Highly Influential