ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let α=ωω\alpha=\omega^\omega. For every red/blue coloring of the edges of the complete graph KαK_\alpha, there is either a red copy of KαK_\alpha or a blue copy of K3K_3.

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 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.