Addario-Berry–Havet–Linhares Sales–Reed–Thomassé anti-directed-tree conjecture
Statement
Let be a positive integer, and let be a digraph. An anti-directed tree is an oriented tree in which every vertex has in-degree or out-degree .
Anti-directed-tree conjecture. If
then contains every anti-directed tree on vertices.
This is an arc-density analogue of the oriented-path conjecture, replacing a minimum semi-degree hypothesis by a total-arc condition and extending the target from paths to all anti-directed trees. The source gives no resolution of the conjecture.
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.