Li–Li edge-connection conjecture
Statement
Let be a -edge-connected graph, where , and let be a minimum-edge spanning -edge-connected subgraph, meaning a spanning -edge-connected subgraph with minimum . Li–Li edge-connection conjecture.
This is presented as the edge-connectivity analogue of the paper's monochromatic -connection conjecture.
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.