ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For k≥1k\ge 1, a vertex set SS in a kk-connected graph GG is kk-removable when G−SG-S remains kk-connected; a matching is kk-removable when its edge deletion leaves a kk-connected graph. The half-degree matching-removability conjecture. Every kk-connected graph GG with δ(G)≥k+1\delta(G)\ge k+1 contains a kk-removable ⌈(δ(G)+1)/2⌉\lceil(\delta(G)+1)/2\rceil-matching, unless δ(G)\delta(G) is even and G≅Kδ(G)+1G\cong K_{\delta(G)+1}. The paper's theorem supports this for k≤3k\le 3, except for the case k=3k=3 and δ(G)=4\delta(G)=4; 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 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.