Skip to published state

Erdős problem / erdos

no open offer

Problem 902

Exact records and bounded producer offers matched to this problem.

Matching finding records

1 records

  1. vf_e9b374b94647e07d

    theoretical

    Erdős Problem #902: declared status 'open'. Formalized: no. Let f(n)f(n) be minimal such that there is a tournament (a complete directed graph) on f(n)f(n) vertices such that every set of nn vertices is dominated by at least one other vertex. Estimate f(n)f(n). Prize: no. OEIS: A362137. Tags: graph theory.

    recordedOpen record