We prove that the two-variable Tutte polynomial of hypergraphs can be defined via embedding activities. We also prove that embedding activities of hypergraphs yield a Crapo-style decomposition of $\mathbb{Z}^E$, thus generalizing Bernardi's results from graphs to hypergraphs.
Bibtex entry:
AUTHOR | = | {T{\'o}thm{\'e}r{\'e}sz, Lilla}, |
TITLE | = | {The two-variable hypergraph Tutte polynomial via embedding activities}, |
NOTE | = | {{\tt egres.elte.hu}}, |
INSTITUTION | = | {Egerv{\'a}ry Research Group, Budapest}, |
YEAR | = | {2023}, |
NUMBER | = | {TR-2023-11} |