Erdős problem 582 · problems.science

Does there exist a graph $G$ which contains no $K_4$ , and yet any $2$ -colouring of the edges produces a monochromatic $K_3$ ?

Result history

Published changes, performers, checks, and later corrections.

No result history yet

No proposed change is retained for this Problem, so there is nothing to show a decision on.

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:7770dd71d633a1f6ae6d314b2cf84943a0e6e5ad1d568525ff43713c6e5e92ec
Metadata: sha256:ec7fd07126efd281b8f4cbbfd838070681ba699659bd8ec30a4bc8d5b421edbe
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:e8477120881b028e5c102207c73c9a768a55443a71b8b96e4a6b7f1f70375d39

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207