2 problems

Let $G$ be a directed graph equipped with the ribbon structure, base node, and base edge used to define its Jaeger trees. The Jaeger-tree triangulation–greedoid conjecture. Jaeger…

Let $G$ be a connected bipartite graph with bipartition $(V,E)$. Let $I_{(V,E)}$ and $I_{(E,V)}$ be the interior polynomials obtained by exchanging the two parts, and let the root…