Spectral Erd\H{o}s--Gallai Theorems for the \(\mathcal A_\alpha\)-Tensor of the \(s\)-Clique Hypergraph
The Erd\H{o}s--Gallai theorem determines the maximum number of edges in a graph with bounded matching number; its clique-counting extension replaces edges by $s$-cliques, and a spectral analogue in terms of the $s$-clique tensor has recently been established. We study the corresponding $\mathcal A_\alpha$-tensor of the...