3 problems

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 acts on graphs formed by finitely many bridge sums of trees and complete graphs. Iterated bridge-sum conjecture. For any finite number of bridge sums of trees and c…

Let $v\in\mathbb{R}^n$ have distinct coordinates, with $n\geq 3$, and let a hyperplane through the origin be given by an equation in the coordinates $x_1,\ldots,x_n$. The orbit of…