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}
}
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
Proof of a Conjecture of Henning and Yeo on Vertex-Disjoint Directed Cycles
  • 9
Vertex-disjoint cycles in bipartite tournaments
  • 2
  • PDF
A Step toward the Bermond--Thomassen Conjecture about Disjoint Cycles in Digraphs
  • 27
  • Highly Influential
  • PDF
Vertex Disjoint Cycles of Different Length in Digraphs
  • 12
On the problem of finding disjoint cycles and dicycles in a digraph
  • 10
Disjoint 3-Cycles in Tournaments: A Proof of The Bermond-Thomassen Conjecture for Tournaments
  • 18
  • Highly Influential
  • PDF
Vertex-disjoint directed and undirected cycles in general digraphs
  • 8
  • PDF
Digraphs - theory, algorithms and applications
  • 1,696
  • PDF
Disjoint cycles in digraphs
  • 63
  • Highly Influential
...
1
2
...