On the Chudnovsky-Seymour-Sullivan conjecture on cycles in triangle-free digraphs
On the Chudnovsky-Seymour-Sullivan conjecture on cycles in triangle-free digraphs
For a simple digraph G without directed triangles or digons, let \beta(G) be the size of the smallest subset X of E(G) such that G\X has no directed cycles, and let \gamma(G) be the number of unordered pairs of nonadjacent vertices in G. In 2008, Chudnovsky, Seymour, and Sullivan showed …