A unified switching construction produces E-cospectral uniform hypergraphs and shows that one standard method for computing E-characteristic polynomials is uninformative for almost all hypergraphs.
The rank of random graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A general switching method for constructing E-cospectral hypergraphs
A unified switching construction produces E-cospectral uniform hypergraphs and shows that one standard method for computing E-characteristic polynomials is uninformative for almost all hypergraphs.