Every connected graph on $n$ vertices can be partitioned into at most $⌈ n /2 ⌉$ edge-disjoint paths.

Worked, still open.

graph theory · open · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

evidence

unverified AI candidates (2)

gpt-erdos · GPT-5.2 Pro + Deep Research · unverified

What you wrote is **exactly Gallai’s path decomposition conjecture** (1968):

llm-hunter · gpt pro 5.2 · unverified

1 LLM attack(s) recorded (gpt pro 5.2); unverified.

open