On short cycles in triangle-free oriented graphs
- 36 Downloads
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.
Keywordsoriented graph cycle minimum semidegree
MSC 201005C20 05C38
Unable to display preview. Download preview PDF.
- 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
- P. Hamburger, P. Haxell, A. Kostochka: On directed triangles in digraphs. Electron. J. Comb. 14 (2007), Research Paper N19, 9 pages.Google Scholar
- 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
- 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