Erdős problem 180
For every finite family of graphs, is there a single with ? A counterexample refutes the Erdős-Simonovits compactness conjecture.
- Formal statements
- 2 solved
- Erdős Problems says
- open (Lean)
- Decision here
- No current contribution
- Checks
- 0 checks · 2 formal
Current Result
Current Result
No result has been accepted here yet.
- Type
- —
- Evidence
- 0 artifacts
- Decision
- None
- Reviewed
- No date retained