Fujita–Kawarabayashi connected-subgraph removal conjecture
Statement
Let and be positive integers. A graph is -connected when its connectivity number is at least , and denotes the minimum degree of .
Fujita–Kawarabayashi conjecture. There is a least non-negative integer such that every -connected graph satisfying
contains a connected subgraph of order for which is still -connected.
The conjecture generalizes results guaranteeing the deletion of one vertex or one edge while preserving -connectivity. The supplied text gives no resolution status, so the conjecture is recorded 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.