arXiv (All)
open access
Spectral Erdős--Gallai Theorems for the \(\mathcal A_α\)-Tensor of the \(s\)-Clique Hypergraph
The Erdő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_α$-te
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On minimal regular graphs with given constraintsm#1041667
- Main-Factor Allocation and Coronal Realizability for Generalized Cospectral Mates of Trees#974564
- CTMRG as a tensor-network message-passing algorithm#1155566
- Rigidity of complements of bounded-degree graphs#972010
- Simplicial closure fragments the explosive cooperation transitions in higher-order public goods games#1233950
Record · ID 1218397
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive