ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a 22-connected graph with a longest cycle LL. For an HH-bridge BB, let its length λ(B)\lambda(B) be the maximum number of edges in a tree within BB whose leaves are exactly the attachments of BB. Let B1,B2,…,BkB_1, B_2, \ldots, B_k be LL-bridges that are pairwise vertex-disjoint and induce a tree in the overlap graph OG(L)O_G(L), whose vertices are the LL-bridges and whose edges join overlapping bridges.

Voss's conjecture.

∑i=1kλ(Bi)≤⌊∣E(L)∣2⌋.\sum_{i=1}^{k} \lambda(B_i) \leq \left\lfloor \frac{|E(L)|}{2} \right\rfloor.

Voss established the cases k≤3k \leq 3, 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 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.