Erdős Problem #112
Statement
Let be minimal such that any directed graph on vertices must contain either an independent set of size or a transitive tournament of size . Determine .
Record
- Source
- 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.