%A Glebov, Roman
%A Grzesik, Andrzej
%A Volec, Jan
%D 2019
%T Degree conditions forcing oriented cycles
%K
%X The longstanding Caccetta-Häggkvist Conjecture is asking for the minimum outdegree (or semidegree) in an oriented graph that forces the appearance of a directed cycle of a bounded length. Motivated by this, Kelly, Kühn and Osthus made a conjecture on the minimal semidegree forcing the appearance of a directed cycle of a given length, and proved it for cycles of length not divisible by 3. Here we prove all the remaining cases of their conjecture with the optimal semidegree threshold.
%U http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1291
%J Acta Mathematica Universitatis Comenianae
%0 Journal Article
%P 729-733%V 88
%N 3
%@ 0862-9544
%8 2019-07-30