Garamvölgyi–Jordán–Király–Villányi rigidity-packing conjectures
Statement
For all positive integers and , every -connected graph contains pairwise edge-disjoint spanning subgraphs, each of which is -rigid. More generally, for all positive integers and , every -connected graph contains a spanning -rigid subgraph and pairwise edge-disjoint spanning trees, all mutually edge-disjoint.
Record
- 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.