Skip to published state

Erdős problem / erdos

no open offer

Problem 642

Exact records and bounded producer offers matched to this problem.

Matching finding records

1 records

  1. vf_05ec3e7c60c2c8ae

    theoretical

    Erdős Problem #642: declared status 'open'. Formalized: no. Let f(n)f(n) be the maximal number of edges in a graph on nn vertices such that all cycles have more vertices than diagonals. Is it true that f(n)≪nf(n)\ll n? Prize: no. Tags: cycles, graph theory.

    recordedOpen record