ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For all positive integers dd and tt, every td(d+1)t d(d+1)-connected graph contains tt pairwise edge-disjoint spanning subgraphs, each of which is dd-rigid. More generally, for all positive integers dd and rr, every (d(d+1)+2r)\bigl(d(d+1)+2r\bigr)-connected graph contains a spanning dd-rigid subgraph and rr pairwise edge-disjoint spanning trees, all mutually edge-disjoint.

Record

Added
Links

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.