Erdős Problem #61
Statement
For any graph is there some such that every graph on vertices that does not contain as an induced subgraph contains either a complete graph or independent set on vertices?
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.