Orbit length conjecture for iterated bridge sums of trees and complete graphs
Let G1=(V1,E1),…,Gq=(Vq,Eq)G_1=(V_1,E_1),\ldots,G_q=(V_q,E_q)G1=(V1,E1),…,Gq=(Vq,Eq) be graphs on n1,…,nqn_1,\ldots,n_qn1,…,nq vertices, respectively, where each GiG_iGi is either a complete graph or a tree. Form GGG by bridge summing…