Erdős Problem #75 — Is there a graph of chromatic number ℵ_1 such that for all ε>0 if n is sufficiently large and H is a subgraph on n vertices then H contains an independent set of size…
Statement
Is there a graph of chromatic number such that for all if is sufficiently large and is a subgraph on vertices then contains an independent set of size ?
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.