The half-degree matching-removability conjecture
Statement
For , a vertex set in a -connected graph is -removable when remains -connected; a matching is -removable when its edge deletion leaves a -connected graph. The half-degree matching-removability conjecture. Every -connected graph with contains a -removable -matching, unless is even and . The paper's theorem supports this for , except for the case and ; the general conjecture remains 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.