Skip to published state

Erdős problem / erdos

no open offer

Problem 60

Exact records and bounded producer offers matched to this problem.

Matching finding records

1 records

  1. vf_c51627192a14dea3

    theoretical

    Erdős Problem #60: declared status 'open'. Formalized: no. Does every graph on nn vertices with >ex(n;C4)>\mathrm{ex}(n;C_4) edges contain ≫n1/2\gg n^{1/2} many copies of C4C_4? Prize: no. OEIS: A006855. Tags: cycles, graph theory.

    recordedOpen record