Tree decompositions and many-sided separations

Tara Abrishami

A separation of a graph $G$ is a partition $(A_1,A_2,C)$ of $V(G)$ such that $A_1$ is anticomplete to $A_2$. A classic result from Robertson and Seymour's Graph Minors Project st…