ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT be a tree of order mm, and let GG be a kk-connected graph. Write δ(G)\delta(G) for the minimum degree of GG. A tree subgraph is kk-redundant if it has the redundancy property intended in the source. Redundant-tree conjecture. If

δ(G)≥⌊3k2⌋+m−1,\delta(G)\geq\left\lfloor\frac{3k}{2}\right\rfloor+m-1,

then GG contains a kk-redundant tree isomorphic to TT. This conjecture proposes a degree condition ensuring a prescribed redundant tree in a highly connected graph; the supplied text gives no resolution.

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 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.