Erdős problem 180
For every finite family of graphs, is there a single with ? A counterexample refutes the Erdős-Simonovits compactness conjecture.
Workspace
public preview
- #180
- None
- 0
Reported activity
Work these sources record against this Problem. Source-reported attribution, not reviewed here.
Valid but non-improving proofs
construction
- Machine
- Reported outcome