The Hopf monoid and the basic invariant of directed graphs
From MaRDI portal
Publication:2231245
zbMath1473.05110arXiv1907.10825MaRDI QIDQ2231245
Publication date: 29 September 2021
Published in: Osaka Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.10825
Graph polynomials (05C31) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Flows in graphs (05C21)
Cites Work
- Unnamed Item
- Unnamed Item
- A quasisymmetric function for matroids
- Une théorie combinatoire des séries formelles
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Tutte polynomials for directed graphs
- Acyclic orientations of graphs
- Submodular functions and optimization.
- Monoidal Functors, Species and Hopf Algebras
- Permutohedra, Associahedra, and Beyond
- Coalgebras and bialgebras in combinatorics
- Computing the Continuous Discretely
- Hopf Algebras of Combinatorial Structures
- Ordered structures and partitions
- Combinatorics and commutative algebra
- Hopf Monoids and Generalized Permutahedra
This page was built for publication: The Hopf monoid and the basic invariant of directed graphs
