The non-crossing ELP-cut conjecture for matching-covered graphs
Statement
Let be a matching-covered graph. A tight cut is a cut met by exactly one edge of every perfect matching, and an ELP-cut is a barrier cut or a -separation cut. A cut is nontrivial when neither shore is a singleton. Two cuts cross when each of the four intersections of their shores is nonempty.
Non-crossing ELP-cut conjecture. If is a nontrivial tight cut of , then has an ELP-cut that does not cross .
This conjecture was given as an alternative formulation related to the ELP Theorem, which asserts that every matching-covered graph with a nontrivial tight cut also has a nontrivial ELP-cut. The supplied text does not indicate whether the conjecture has been resolved.
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.