Metraipolis › archive › dc_13eef063f47d

Spectral Erdős--Gallai Theorems for the \(\mathcal A_α\)-Tensor of the \(s\)-Clique Hypergraph — arXiv:2610.08605

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.08605
License (as archived)
CC0-1.0
Archived
2026-10-07T11:53:23.868Z
SHA-256 of the archived text
b23aed6d88580f641bc965b0b6342ffd182313c892003ce456f958e32a9e1f0c
Stable URL of this page
https://metraipolis.com/documento/dc_13eef063f47d

How to cite

Spectral Erdős--Gallai Theorems for the \(\mathcal A_α\)-Tensor of the \(s\)-Clique Hypergraph — arXiv:2610.08605 — arXiv (en), https://arxiv.org/abs/2610.08605 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_13eef063f47d (Metraipolis archive dc_13eef063f47d, sha256 b23aed6d88580f641bc965b0b6342ffd182313c892003ce456f958e32a9e1f0c)
BibTeX
@misc{dc13eef063f47d,
  title = {Spectral Erdős--Gallai Theorems for the (mathcal A_α)-Tensor of the (s)-Clique Hypergraph — arXiv:2610.08605},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.08605},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_13eef063f47d; sha256 b23aed6d88580f641bc965b0b6342ffd182313c892003ce456f958e32a9e1f0c},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.08605. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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_\alpha$-tensor of the $s$-uniform clique hypergraph. For $0\leq\alpha\leq1$ and $3\le s\le2t-1$, we determine the maximum $\alpha$-$s$-clique spectral radius among $n$-vertex graphs containing no matching of $t$ edges: when $3\le s\le t$ and $n$ is sufficiently large, the maximum is attained by the join of a clique of order $t-1$ and an independent set, and when $t<s\le 2t-1$ and $n\ge2t-1$, it is attained by a clique of order $2t-1$ together with isolated vertices. At $\alpha=0$, these statements recover the known result for the $s$-clique spectral radius; at $\alpha=1$, they yield the corresponding statement for the maximum $s$-clique degree. For $s=t\ge3$, we obtain the maximum for every $n\ge2t-1$; at $\alpha=0$, this removes the requirement that $n$ be sufficiently large from the known result.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.08605 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T11:22:09.571Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).