Skip to content

Erdős problem 794

Start work

Is it true that every 33-uniform hypergraph on 3n3n vertices with at least n3+1n^3+1 edges must contain either a subgraph on 44 vertices with 33 edges or a subgraph on 55 vertices with 77 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:248bb80f6dc88105c4501c6c60714376250cdeb91c04c7bc09e8221bca03838c
Metadata
sha256:0b3a0a9036fb5a0e2a51b7cfa75f9d6986e46d5da125e4e35564b7e0524af9ae
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:abab57ca7ce073818ea20831c65ddf778c07eca15e33e3090ac085372fbb8ad3
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON