On a relationship between the characteristic and matching polynomials of a uniform hypertree

Honghai Li, Li Su, Shaun Fallat

A hypertree is a connected hypergraph without cycles. Further a hypertree is called an $r$-tree if, additionally, it is $r$-uniform. Note that 2-trees are just ordinary trees. A cl…