Lovász–Cherkassky theorem without the countability hypothesis
Statement
Let be a graph and let such that there is no for which is an odd natural number. A system of edge-disjoint -paths has the required cut property when, for every , one can choose exactly one edge from each path having as an end-vertex so that the resulting edge set is a cut separating from .
Lovász–Cherkassky conjecture. Under these hypotheses, there exists a system of edge-disjoint -paths having the required cut property for every .
The paper proves the corresponding statement when is countable and conjectures that countability can be omitted. The unrestricted case is presented as open.
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.