Gallai's path decomposition conjecture
Statement
Let be a connected graph on vertices, and let denote the minimum number of paths in a path decomposition of . Gallai's conjecture.
This conjecture is a central problem on path decompositions; the paper notes that it is difficult for graphs with many vertices of even degree and discusses known results for general graphs and Eulerian graphs of maximum degree at most .
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.