Abstract
For a simple directed graph G with no directed triangles, let β(G) be the size of the smallest subset X ∈ E(G) such that G\X has no directed cycles, and let γ(G) denote the number of unordered pairs of nonadjacent vertices in G. Chudnovsky, Seymour, and Sullivan showed that β(G) ≤ γ(G), and conjectured that β(G) ≤ \(\tfrac{{\gamma (G)}} {2}\) . In this paper we prove that β(G)<0.88γ(G).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
L. Caccetta and R. Häggkvist: On minimal digraphs with given girth, Congressus Numerantium XXI (1978), 181–187.
M. Chudnovsky, P. Seymour and B. Sullivan: Cycles in dense digraphs, Combinatorica 28(1) (2008), 1–18.
J. Fox, P. Keevash and B. Sudakov: Directed graphs without short cycles, Combinatorics, Probability, and Computation 19(2) (2009), 285–301.
P. Hamburger, P. Haxell and A. Kostochka: On directed triangles in digraphs, Electronic Journal of Combinatorics 14 (2007), #N19.
B. Sullivan: A summary of results and problems related to the Caccetta-Häggkvist conjecture, manuscript, AIM Preprint 2006-13, www.aimath.org/preprints.html.