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.

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

Retained declaration

FormalConjectures/ErdosProblems/180.lean

Formal Conjectures

FormalConjectures/ErdosProblems/180.leanErdos180.erdos_1803 linesExact file

1False ↔2  ∀ (family : Finset Erdos180.FiniteGraph),3    family.Nonempty → Erdos180.IsCyclicFamily family → Erdos180.IsCompactFamily family

SolvedStatement only, no proof

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

Valid but non-improving proofs
GPT-Erdős
Open the source record
construction
VibeMathed
Machine
Astra (internal preview)
Reported outcome
candidate
Open the source record

Continue

Start a contribution Browse the source files Open the collection entry

No current result

Reported activity

Continue

Search problems.science