ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G=(V,E)G=(V,E) be a finite simple digraph with no directed cycle of length at most three; call such a digraph 3-free. Let β(G)\beta(G) be the minimum cardinality of a set X⊆E(G)X\subseteq E(G) such that G∖XG\setminus X is acyclic, and let gamma(G)gamma(G) be the number of unordered pairs of nonadjacent vertices of GG.

Chudnovsky–Seymour–Sullivan conjecture. If GG is a 3-free digraph, then

β(G)≤12γ(G).\beta(G) \leq \frac{1}{2}\gamma(G).

Chudnovsky, Seymour, and Sullivan proved the weaker bound β(G)≤γ(G)\beta(G)\leq\gamma(G), later improved by Dunkum, Hamburger, and Pór to β(G)≤0.88γ(G)\beta(G)\leq 0.88\gamma(G); the conjectured factor 1/21/2 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.