Erdős problem 180 · problems.science

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.

Sources

Browse retained paths and inspect the exact material available for this Problem.

3 retained statements2415f78e850a

Open selected source

Retained excerpts/

VibeMathed

Retained source excerpt1 of 1

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.

Open exact source location

Sources

Search problems.science