Voss's bridge-length conjecture for longest cycles
Statement
Let be a -connected graph with a longest cycle . For an -bridge , let its length be the maximum number of edges in a tree within whose leaves are exactly the attachments of . Let be -bridges that are pairwise vertex-disjoint and induce a tree in the overlap graph , whose vertices are the -bridges and whose edges join overlapping bridges.
Voss's conjecture.
Voss established the cases , which have useful applications to problems on cycles. The general conjecture is solved by the paper from which this statement is taken.
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.