Skip to content

Erdős problem 639

Start work

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

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands here
  6. Next gapNot recorded

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.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:f6c170d8ffefed174f841243da9b5ece6b3a498a6a483be1909b83de2deac8bb
Metadata
sha256:f852767041c2b8c9c6ad0acedda55e730e8f77dde558b310655ff90a7b08a5a5
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:7a6967bda1506f37ae78bd2a49d66f271c7eb2c3e40e215224f1409daa0f059d
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON