Skip to Main content Skip to Navigation
Journal articles

Disjoint cycles of different lengths in graphs and digraphs

Abstract : In this paper, we study the question of finding a set of $k$ vertex-disjoint cycles (resp. directed cycles) of distinct lengths in a given graph (resp. digraph). In the context of undirected graphs, we prove that, for every $k \geq 1$, every graph with minimum degree at least $\frac{k^2+5k-2}{2}$ has~$k$ vertex-disjoint cycles of different lengths, where the degree bound is best possible. We also consider other cases such as when the graph is triangle-free, or the $k$ cycles are required to have different lengths modulo some value $r$. In the context of directed graphs, we consider a conjecture of Lichiardopol concerning the least minimum out-degree required for a digraph to have $k$ vertex-disjoint directed cycles of different lengths. We verify this conjecture for tournaments, and, by using the probabilistic method, for some regular digraphs and digraphs of small order.
Document type :
Journal articles
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download
Contributor : Julien Bensmail <>
Submitted on : Friday, December 1, 2017 - 12:21:34 PM
Last modification on : Tuesday, May 26, 2020 - 6:50:53 PM


Files produced by the author(s)


  • HAL Id : hal-01653334, version 1


Julien Bensmail, Ararat Harutyunyan, Ngoc Khang Le, Binlong Li, Nicolas Lichiardopol. Disjoint cycles of different lengths in graphs and digraphs. The Electronic Journal of Combinatorics, Open Journal Systems, 2017, 24 (4). ⟨hal-01653334⟩



Record views


Files downloads