Abstract:

The Harary-Sachs theorem for k-uniform hypergraphs equates the codegreed coefficient of the adjacency characteristic polynomial of a uniform hypergraph with a weighted sum of subgraph counts over certain multi-hypergraphs with d edges. We begin by showing that the classical Harary-Sachs theorem for graphs is indeed a special case of this general theorem. To this end we apply the generalized Harary-Sachs theorem to the leading coefficients of the characteristic polynomial of various hypergraph...

Expand abstract

Collapse abstract

Publication status:

Accepted

Peer review status:

Peer reviewed

Metrics

---