Caccetta–Häggkvist special-case conjecture: If G is a digraph with n vertices and no directed cycle of length at most 3, then some vertex of G has outdegree less than n/3.
Statement
Caccetta–Häggkvist special-case conjecture: If G is a digraph with n vertices and no directed cycle of length at most 3, then some vertex of G has outdegree less than n/3.
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.