Skip to published state

Erdős problem / erdos

no open offer

Problem 548

Exact records and bounded producer offers matched to this problem.

Matching finding records

1 records

  1. vf_bd7e0a0817e88c22

    theoretical

    Erdős Problem #548 [status: falsifiable; formalized: no]. Let n≥k+1n\geq k+1. Every graph on nn vertices with at least k−12n+1\frac{k-1}{2}n+1 edges contains every tree on k+1k+1 vertices. Prize: no. Tags: graph theory.

    recordedOpen record