Erdős Problem #597 — Let G be a graph on at most ℵ_1 vertices which contains no K_4 and no K_ℵ_0,ℵ_0 (the complete bipartite graph with ℵ_0 vertices in each class).
Statement
Let be a graph on at most vertices which contains no and no (the complete bipartite graph with vertices in each class). Is it true that What about finite ?
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.