ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT be a 22-linear tree, and let its bridge be the distinguished path joining its two linear components. Write Max⁡(T)\operatorname{Max}(T) for the set of maximum arrangements of TT, and MaxBip⁡(T)\operatorname{MaxBip}(T) for the set of maximal bipartite arrangements of TT.

Odd-bridge conjecture. If the bridge of TT has odd length, then no maximal non-bipartite arrangement is a maximum arrangement; equivalently,

Max⁡(T)=MaxBip⁡(T).\operatorname{Max}(T)=\operatorname{MaxBip}(T).

The conjecture is motivated by exhaustive data showing that odd-bridge 22-linear trees of the tested orders are maximizable only by bipartite arrangements. A proof for all such trees is not supplied.

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.