Erdős Problem #925 — Independent sets in graphs that are not triangle-Ramsey
Statement
Is there an absolute such that every sufficiently large -vertex graph whose edges admit a two-coloring with no monochromatic triangle has an independent set of size at least for some absolute ?
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.