Skip to content

Erdős problem 23

Start work

The blow-up of C5C_5 shows that the bound n2n^2 in Erdős Problem 23 is tight: any bipartite subgraph must omit at least n2n^2 edges.

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:99a63be68c775fda42adc01238f14d079edc909c944a89657bada7abe05de9f6
Metadata
sha256:278aa090cd8cee6f3e9bd493d8b2d546c60e14dc7633dd2ccd804510283c7ce4
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:d3883c746181913ef655b05da69dd06bb1afd33e1ff9f86b695c8de1775f0ddf
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON