Erdős Problem #1111
Statement
If is a finite graph and are disjoint sets of vertices then we call anticomplete if there are no edges between and . If then there exists such that if and then there are anticomplete sets with .
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.