3 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…

Characterization conjecture. $CritIndep(G)$ is a greedoid if and only if $G[N[S]]$ is a König–Egerváry graph with a unique perfect matching for every $S\in\Psi(G)$.

Let a rooted digraph be determined by its greedoid polynomial if no other non-isomorphic rooted digraph has the same greedoid polynomial. Greedoid-polynomial non-determination conj…