Erdős problem 60 · problems.science

Does every graph on $n$ vertices with $>\mathrm{ex}(n;C_4)$ edges contain $\gg n^{1/2}$ many copies of $C_4$ ?

No current result

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

Retained declaration

FormalConjectures/ErdosProblems/60.lean

Formal Conjectures

FormalConjectures/ErdosProblems/60.leanErdos60.erdos_605 linesExact file

1∃ c > 0,2  ∀ᶠ (n : ℕ) in Filter.atTop,3    ∀ (G : SimpleGraph (Fin n)) [inst : DecidableRel G.Adj],4      SimpleGraph.extremalNumber n (SimpleGraph.cycleGraph 4) < G.edgeFinset.card →5        c * √↑n ≤ ↑{H' | Nonempty (H'.coe ≃g SimpleGraph.cycleGraph 4)}.ncard

OpenStatement only, no proof

Continue

Start a contribution Browse the source files Open the collection entry

No current result

Continue

Search problems.science