Partitioning edge-connectivity
Statement
Question Let be an -edge-connected graph. Does there exist a partition of so that is -edge-connected and is -edge-connected?
Record
- Source
- Added
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.