ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let SS be a family of finite graphs such that for every nn there is some Gn∈SG_n\in S such that if the edges of GnG_n are coloured with nn colours then there is a monochromatic triangle. Is it true that for every infinite cardinal ℵ\aleph there is a graph GG of which every finite subgraph is in SS and if the edges of GG are coloured with ℵ\aleph many colours then there is a monochromatic triangle.

Record

Added
Links

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.