A geometric proof for the root-independence of the greedoid polynomial of Eulerian branching greedoids

DOI10.1016/J.JCTA.2024.105891zbMATH Open1540.05068MaRDI QIDQ6543051

Lilla Tóthmérész

Publication date: 24 May 2024

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

zbMATH Keywords

triangulationregular matroidroot polytopegreedoid

Mathematics Subject Classification ID

Graph polynomials (05C31) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Games involving graphs (91A43) Combinatorial aspects of matroids and geometric lattices (05B35) Directed graphs (digraphs), tournaments (05C20) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Chip-firing game and a partial Tutte polynomial for Eulerian digraphs
• Homotopy properties of greedoids
• Abelian sandpile model and Biggs-Merino polynomial for directed graphs
• Hypergraph polynomials and the Bernardi process
• Permutohedra, Associahedra, and Beyond
• Self-organized critical state of sandpile automaton models
• Oriented Matroids
• Root polytopes, Tutte polynomials, and a duality theorem for bipartite graphs
• ARITHMETIC ASPECTS OF SYMMETRIC EDGE POLYTOPES
• Root polytopes and Jaeger‐type dissections for directed graphs
• \(h^*\) -vectors of graph polytopes using activities of dissecting spanning trees

This page was built for publication: A geometric proof for the root-independence of the greedoid polynomial of Eulerian branching greedoids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6543051)