Erdős problem 775
Is there a -uniform hypergraph on vertices which contains at least different sizes of cliques (maximal complete subgraphs)?
- Formal statements
- 4 solved
- Erdős Problems says
- disproved (Lean)
- Decision here
- No current contribution
- Checks
- 0 checks · 4 formal
Current Result
Current Result
No result has been accepted here yet.
- Type
- —
- Evidence
- 0 artifacts
- Decision
- None
- Reviewed
- No date retained