3 problems

Let…

Let $G_1=(V_1,E_1),\ldots,G_q=(V_q,E_q)$ be graphs on $n_1,\ldots,n_q$ vertices, respectively, where each $G_i$ is either a complete graph or a tree. Form $G$ by bridge summing…

Toric promotion order conjecture. If $G$ is a path graph with $n$ vertices and $1\leq h\leq \left\lfloor n/2\right\rfloor$, then the operator…