Skip to content

Erdős problem 582

Start work

Does there exist a graph GG which contains no K4K_4, and yet any 22-colouring of the edges produces a monochromatic K3K_3?

Erdős Problems records this as proved (Lean).

No Repository has ruled on it here.

How far the record reaches4 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal1 retained
  4. Resolutionproved (Lean)
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingWork

Nothing here has checked that finding.

Reproducing it here turns a report into evidence.

Open the work surface
Where the source files it318 share a topic
Graph Theory275Ramsey Theory114
None carries a Standing. Browse the topic.
Start workOpen sources