The odd-bridge conjecture for 2-linear trees
Statement
Let be a -linear tree, and let its bridge be the distinguished path joining its two linear components. Write for the set of maximum arrangements of , and for the set of maximal bipartite arrangements of .
Odd-bridge conjecture. If the bridge of has odd length, then no maximal non-bipartite arrangement is a maximum arrangement; equivalently,
The conjecture is motivated by exhaustive data showing that odd-bridge -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.