The redundant-tree conjecture for highly connected graphs
Statement
Let be a tree of order , and let be a -connected graph. Write for the minimum degree of . A tree subgraph is -redundant if it has the redundancy property intended in the source. Redundant-tree conjecture. If
then contains a -redundant tree isomorphic to . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.