Erdős Problem #638
Statement
Let be a family of finite graphs such that for every there is some such that if the edges of are coloured with colours then there is a monochromatic triangle. Is it true that for every infinite cardinal there is a graph of which every finite subgraph is in and if the edges of are coloured with many colours then there is a monochromatic triangle.
Record
- Source
- Added
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.