Conjecture on bondage number and minimum edge-degree
Statement
Let be a connected graph other than and . Write for its bondage number, for its minimum degree, and for its restricted edge-connectivity. Bondage–edge-connectivity conjecture.
The source proposes this inequality after combining known bounds, but gives no evidence of a resolution.
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.