Erdős Problem #922 — Hereditary independence forces bounded chromatic number
Statement
Let . If every finite induced subgraph of a graph has an independent set of size at least , must ?
Record
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.