For a_1,a_2\geq 1, does every (a_1+a_2+2)-edge-connected graph G have edge-disjoint spanning subgraphs G_1,G_2 such that G_j is a_j-edge-connected for j=1,2?
Statement
For a_1,a_2\geq 1, does every (a_1+a_2+2)-edge-connected graph G have edge-disjoint spanning subgraphs G_1,G_2 such that G_j is a_j-edge-connected for j=1,2?
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.