Journal article
A Harary-Sachs theorem for hypergraphs
- Abstract:
- We generalize the Harary-Sachs theorem to k-uniform hypergraphs: the codegree-d coefficient of the characteristic polynomial of a uniform hypergraph H can be expressed as a weighted sum of subgraph counts over certain multi-hypergraphs with d edges. We include a detailed description of the aforementioned multi-hypergraphs and a formula for their corresponding weights.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Accepted manuscript, 294.1KB, Terms of use)
-
- Publisher copy:
- 10.1016/j.jctb.2021.01.002
Authors
- Publisher:
- Elsevier
- Journal:
- Journal of Combinatorial Theory, Series B More from this journal
- Volume:
- 149
- Pages:
- 1-15
- Publication date:
- 2021-01-14
- Acceptance date:
- 2021-01-08
- DOI:
- ISSN:
-
0095-8956
- Language:
-
English
- Keywords:
- Pubs id:
-
1153031
- Local pid:
-
pubs:1153031
- Deposit date:
-
2021-01-11
Terms of use
- Copyright holder:
- Elsevier Inc.
- Copyright date:
- 2021
- Rights statement:
- © 2021 Elsevier Inc. All rights reserved.
- Notes:
- This is the accepted manuscript version of the article. The final version is available online from Elsevier at https://doi.org/10.1016/j.jctb.2021.01.002
If you are the owner of this record, you can report an update to it here: Report update to this record