For every finite family $\mathcal{F}$ of graphs, is there a single $G \in \mathcal{F}$ with $\mathrm{ex}(n;G) \ll_{\mathcal{F}} \mathrm{ex}(n;\mathcal{F})$ ? A counterexample refutes the Erdős-Simonovits compactness conjecture.

Declared status: open (Lean)
Formalization: formalized
Subjects: graph theoryturan number
OEIS: N/A
Sources: source:erdos-problemssource:formal-conjecturessource:gpt-erdossource:vibemathed
Statement: www.erdosproblems.com

Matching claims

No direct claims

This problem has no directly related claim record.