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?

Erdős Problems records this as disproved (Lean).

No Repository has ruled on it here.

How far the record reaches4 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal4 retained
  4. Resolutiondisproved (Lean)
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingWork

Nothing here has checked that finding.

Reproducing it here turns a report into evidence.

Open the work surface
Where the source files it285 share a topic
Graph Theory275Hypergraphs31Turan Number23
None carries a Standing. Browse the topic.
Start workOpen sources