Skip to content

Erdős problem 1080

Start work

Let GG be a bipartite graph on nn vertices such that one part has ⌊n2/3⌋\lfloor n^{2/3}\rfloor vertices. Is there a constant c>0c>0 such that if GG has at least cncn edges then GG must contain a C6C_6?

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:f8994a23974324e7862fd8f96bbe9710fc932da67d470c86bbe14c87e9a94a56
Metadata
sha256:142f01099b6e1e49bccd150f0993fb8afc3efbfc4c2a0748d89bf7420d6686e1
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:0b9a6f8a823f356c570053a3d7b68310c20ce5f3dcd7245175275036e6ba772f
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON