ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Call a digraph TT a polytree if TT is obtained from a (finite, undirected) tree by assigning to each edge one of its two possible directions, and call a digraph DD a tournament if for every pair of distinct vertices u,vu,v of DD exactly one of the arcs (u,v)(u,v), (v,u)(v,u) belongs to DD. Say that DD contains TT, written T⊆DT \subseteq D, if there is an injection ϕ:V(T)→V(D)\phi : V(T) \to V(D) such that (ϕ(u),ϕ(v))(\phi(u),\phi(v)) is an arc of DD for every arc (u,v)(u,v) of TT.

For every integer n≥1n \geq 1, every polytree TT on nn vertices, and every tournament DD on 2n−22n-2 vertices,

T⊆D.T \subseteq D.

Record

Added
Links

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.