ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph and let T⊆V(G)T\subseteq V(G) such that there is no X⊆V(G)∖TX\subseteq V(G)\setminus T for which dG(X)d_G(X) is an odd natural number. A system P\mathcal{P} of edge-disjoint TT-paths has the required cut property when, for every t∈Tt\in T, one can choose exactly one edge from each path having tt as an end-vertex so that the resulting edge set CC is a cut separating tt from T−tT-t.

Lovász–Cherkassky conjecture. Under these hypotheses, there exists a system P\mathcal{P} of edge-disjoint TT-paths having the required cut property for every t∈Tt\in T.

The paper proves the corresponding statement when TT 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.