Chudnovsky–Seymour–Sullivan conjecture on cycles in triangle-free digraphs
Statement
Let be a finite simple digraph with no directed cycle of length at most three; call such a digraph 3-free. Let be the minimum cardinality of a set such that is acyclic, and let be the number of unordered pairs of nonadjacent vertices of .
Chudnovsky–Seymour–Sullivan conjecture. If is a 3-free digraph, then
Chudnovsky, Seymour, and Sullivan proved the weaker bound , later improved by Dunkum, Hamburger, and Pór to ; the conjectured factor remains unresolved in the source.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.