A Harary-Sachs Theorem for Hypergraphs
arXiv:1812.00468
Abstract
We generalize the Harary-Sachs theorem to -uniform hypergraphs: the codegree- coefficient of the characteristic polynomial of a uniform hypergraph can be expressed as a weighted sum of subgraph counts over certain multi-hypergraphs with edges. We include a detailed description of the aforementioned multi-hypergraphs and a formula for their corresponding weights.