Erdős problem 639 · problems.science

Is it true that if the edges of $K_n$ are 2-coloured then there are at most $n^2/4$ many edges which do not occur in a monochromatic triangle?

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:f6c170d8ffefed174f841243da9b5ece6b3a498a6a483be1909b83de2deac8bb
Metadata: sha256:f852767041c2b8c9c6ad0acedda55e730e8f77dde558b310655ff90a7b08a5a5
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:7a6967bda1506f37ae78bd2a49d66f271c7eb2c3e40e215224f1409daa0f059d

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