Czechoslovak Mathematical Journal

, Volume 68, Issue 1, pp 67–75

# On short cycles in triangle-free oriented graphs

• Yurong Ji
• Shufei Wu
• Hui Song
Article

## Abstract

An orientation of a simple graph is referred to as an oriented graph. Caccetta and Häggkvist conjectured that any digraph on n vertices with minimum outdegree d contains a directed cycle of length at most ⌈n/d⌉. In this paper, we consider short cycles in oriented graphs without directed triangles. Suppose that α0 is the smallest real such that every n-vertex digraph with minimum outdegree at least α0n contains a directed triangle. Let ε < (3 − 2α0)/(4 − 2α0) be a positive real. We show that if D is an oriented graph without directed triangles and has minimum outdegree and minimum indegree at least (1/(4 − 2α0)+ε)|D|, then each vertex of D is contained in a directed cycle of length l for each 4 ≤ l < (4 − 2α0)ε|D|/(3 − 2α0) + 2.

## Keywords

oriented graph cycle minimum semidegree

05C20 05C38

## Preview

Unable to display preview. Download preview PDF.

## References

1. [1]
J. Bang-Jensen, G. Z. Gutin: Digraphs: Theory, Algorithms and Applications. Springer Monographs in Mathematics, Springer, London, 2001.
2. [2]
J. A. Bondy: Counting subgraphs a new approach to the Caccetta-Häggkvist conjecture. Discrete Math. 165–166 (1997), 71–80.
3. [3]
L. Caccetta, R. Häggkvist: On minimal digraphs with given girth. Proc. 9th Southeast. Conf. on Combinatorics, Graph Theory, and Computing: Florida Atlantic University. Boca Raton, 1978. Congress. Numer. 21, Utilitas Math. Publishing, Winnipeg, 1978, pp. 181–187.Google Scholar
4. [4]
D. Christofides, P. Keevash, D. Kühn, D. Osthus: A semiexact degree condition for Hamilton cycles in digraphs. SIAM J. Discrete Math. 24 (2010), 709–756.
5. [5]
P. Hamburger, P. Haxell, A. Kostochka: On directed triangles in digraphs. Electron. J. Comb. 14 (2007), Research Paper N19, 9 pages.Google Scholar
6. [6]
J. Hladký, D. Král’, S. Norin: Counting flags in triangle-free digraphs. Extended abstracts of the 5th European Conf. on Combinatorics, Graph Theory and Applications (J. Nešetřil, et al., eds.). Bordeaux, 2009, Elsevier, Amsterdam, Electronic Notes in Discrete Mathematics 34, 2009, pp. 621–625.Google Scholar
7. [7]
P. Keevash, D. Kühn, D. Osthus: An exact minimum degree condition for Hamilton cycles in oriented graphs. J. Lond. Math. Soc., II. Ser. 79 (2009), 144–166.
8. [8]
L. Kelly, D. Kühn, D. Osthus: A Dirac-type result on Hamilton cycles in oriented graphs. Comb. Probab. Comput. 17 (2008), 689–709.
9. [9]
L. Kelly, D. Kühn, D. Osthus: Cycles of given length in oriented graphs. J. Comb. Theory, Ser. B 100 (2010), 251–264.
10. [10]
D. Kühn, D. Osthus: A survey on Hamilton cycles in directed graphs. Eur. J. Comb. 33 (2012), 750–766.
11. [11]
D. Kühn, D. Osthus, A. Treglown: Hamiltonian degree sequences in digraphs. J. Comb. Theory, Ser. B 100 (2010), 367–380.
12. [12]
N. Lichiardopol: A new bound for a particular case of the Caccetta-Häggkvist conjecture. Discrete Math. 310 (2010), 3368–3372.
13. [13]
A. A. Razborov: Flag algebras. J. Symb. Log. 72 (2007), 1239–1282.
14. [14]
J. Shen: Directed triangles in digraphs. J. Comb. Theory, Ser. B 74 (1998), 405–407.
15. [15]
B. D. Sullivan: A summary of results and problems related to the Caccetta-Häggkvist conjecture. Available at ArXiv:math/0605646v1 [math.CO] (2006).Google Scholar