Erdős Problem #595 — Is there an infinite graph G which contains no K_4 and is not the union of countably many triangle-free graphs?
Statement
Is there an infinite graph which contains no and is not the union of countably many triangle-free graphs?
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.