Outdegree conditions forcing short cycles in digraphs

MaRDI QIDQ6347462zbMATH OpenFDO

Authors Dan Ismailescu, Andrew Yang

Publication date 20 August 2020

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35)

Abstract: Given a positive integer $mge3$, let $ch(m)$ be the smallest positive constant with the following property: emph{ Every simple directed graph on $nge3$ vertices all whose outdegrees are at least $ch(m)cdotn$ contains a directed cycle of length at most $m$.} Caccetta and H"{a}ggkvist conjectured that $ch(m)=1/m$, which if true, would be the best possible. In this paper, we prove the following result: emph{ For every integer $mge3$, let $alpha(m)$ be the unique real root in $(0,1)$ of the equation} �egin{equation*} (1-x)^{m-2}=frac{3x}{2-x}. end{equation*} Then $ch(m)lealpha(m)$. This generalizes results of Shen who proved that $ch(3)le3-sqrt7<0.35425$, and Liang and Xu who showed that $ch(4)<0.28866$ and $ch(5)<0.24817$. We then slightly improve the above inequality by using the minimum feedback arc set approach initiated by Chudnovsky, Seymour, and Sullivan. This results in extensions of the findings of Hamburger, Haxell and Kostochka (in the case $m=3$), and Liang and Xu (in the case $m=4$).

This page was built for publication: Outdegree conditions forcing short cycles in digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6347462)