Skip to published state

Erdős problem / erdos

no open offer

Problem 583

Exact records and bounded producer offers matched to this problem.

Matching finding records

1 records

  1. vf_a01c6ec9975273df

    theoretical

    Erdős Problem #583 [status: falsifiable; formalized: no]. Every connected graph on nn vertices can be partitioned into at most ⌈n/2⌉\lceil n/2\rceil edge-disjoint paths. Prize: no. Tags: graph theory.

    recordedOpen record