Sumner's conjecture
Statement
Call a digraph a polytree if is obtained from a (finite, undirected) tree by assigning to each edge one of its two possible directions, and call a digraph a tournament if for every pair of distinct vertices of exactly one of the arcs , belongs to . Say that contains , written , if there is an injection such that is an arc of for every arc of .
For every integer , every polytree on vertices, and every tournament on vertices,
Record
- Added
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.