6 citations · 7 across the 3 of their papers we have counts for
4 papers
Disjoint cycles of different lengths in graphs and digraphs
Julien Bensmail, Ararat Harutyunyan, Ngoc Khang Le +2
Understanding how the cycles of a graph or digraph behave in general has always been an important point of graph theory. In this paper, we study the question of finding a set of $k…
On the existence of vertex-disjoint subgraphs with high degree sum
Shuya Chiba, Nicolas Lichiardopol
For a graph , we denote by the minimum degree sum of two non-adjacent vertices if is non-complete; otherwise, . In this paper, we prove the fo…
Strong connectivity and directed triangles in oriented graphs. Partial results on a particular case of the Caccetta-Häggkvist conjecture
Nicolas Lichiardopol
A particular case of Caccetta-Häggkvist conjecture, says that a digraph of order with minimum out-degree at least contains a directed cycle of length at most 3. Recently…
On Robin's criterion for the Riemann Hypothesis
Y. -J. Choie, N. Lichiardopol, P. Moree +1
Robin's criterion states that the Riemann Hypothesis (RH) is true if and only if Robin's inequality sum_{d|n}d<e^{gamma}n loglog n is satisfied for n>=5041, where gamma denotes the…