Skip to content

Erdős problem 775

Start work

Is there a 33-uniform hypergraph on nn vertices which contains at least n−O(1)n-O(1) different sizes of cliques (maximal complete subgraphs)?

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 Theory275Hypergraphs31
None carries a Standing. Browse the topic.
Start workOpen sources