A geometric proof for the root-independence of the greedoid polynomial of Eulerian branching greedoids
From MaRDI portal
Publication:6505809
DOI10.1016/j.jcta.2024.105891zbMatharXiv:2204.12419MaRDI QIDQ6505809
Publication date: 1 January 1
Graph polynomials (05C31) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Oriented matroids in discrete geometry (52C40)
This page was built for publication: A geometric proof for the root-independence of the greedoid polynomial of Eulerian branching greedoids
