ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let kk be a positive integer, and let DD be a digraph. An anti-directed tree is an oriented tree in which every vertex has in-degree 00 or out-degree 00.

Anti-directed-tree conjecture. If

∣A(D)∣>(k−1)∣V(D)∣,|A(D)|>(k-1)|V(D)|,

then DD contains every anti-directed tree on k+1k+1 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 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.