Metraipolis › archive › dc_98708c5bb658

Extremal problems for suspensions of even cycles — arXiv:2608.22414

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.22414
License (as archived)
CC0-1.0
Archived
2026-10-18T08:32:15.438Z
SHA-256 of the archived text
74bf3fa04066a29fa8d4ad23fecd4dae7cb6e4bab59a356f85cb00b12aa79ab1
Stable URL of this page
https://metraipolis.com/documento/dc_98708c5bb658

How to cite

Extremal problems for suspensions of even cycles — arXiv:2608.22414 — arXiv (en), https://arxiv.org/abs/2608.22414 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_98708c5bb658 (Metraipolis archive dc_98708c5bb658, sha256 74bf3fa04066a29fa8d4ad23fecd4dae7cb6e4bab59a356f85cb00b12aa79ab1)
BibTeX
@misc{dc98708c5bb658,
  title = {Extremal problems for suspensions of even cycles — arXiv:2608.22414},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.22414},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_98708c5bb658; sha256 74bf3fa04066a29fa8d4ad23fecd4dae7cb6e4bab59a356f85cb00b12aa79ab1},
  year = {2026}
}

Archived text

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

Given an integer $k\geq2$ and a graph $F$, the $k$-uniform suspension $\mathcal{S}^kF$ is obtained by adjoining a fixed set of $k-2$ new vertices to every edge of $F$. In this paper, we study two extremal problems for suspensions of even cycles. Write $K^k_t$ for the $k$-uniform clique of order $t$. Let $\mathrm{ex}(n,\mathcal{S}^kC_{2\ell})$ and $\mathrm{ex}(n,K^k_t,\mathcal{S}^kC_{2\ell})$ denote the maximum numbers of edges and copies of $K^k_t$, respectively, in an $\mathcal{S}^kC_{2\ell}$-free $k$-uniform hypergraph on $n$ vertices. We prove that, for every $k\geq2$ and infinitely many $n$, \[\mathrm{ex}(n,K^{k}_{k+1},\mathcal{S}^kC_4)=\frac{n^{k-1/2}}{(k+1)!}+O(n^{k-1}).\] This extends a folklore result for $k=2$ and, as an immediate consequence, yields the asymptotics of $\mathrm{ex}(n,\mathcal{S}^kC_4)$ for infinitely many $n$, previously established by Mubayi (for all $n$). Furthermore, for every $k\geq2$ and $\ell\in\{3,5\}$, we determine the order of magnitude \[\mathrm{ex}(n,\mathcal{S}^kC_{2\ell})=\Theta(n^{k-1+1/\ell}).\] This generalizes both the classical graph case $k=2$ and a previous result of Mukherjee for $k=\ell=3$. The principal difficulty in both problems lies in constructing the lower bounds. Our construction for $\mathrm{ex}(n,K^{k}_{k+1},\mathcal{S}^kC_4)$ incorporates a novel block-packing structure, which yields substantially more copies of $K^k_{k+1}$ than previously known constructions. For $\mathrm{ex}(n,\mathcal{S}^kC_{2\ell})$ with $\ell\in\{3,5\}$, we establish a natural $k$-uniform version of Wenger graphs, addressing the subtleties involved in lifting extremal graph constructions to suspensions. We also give applications of our results to Turán problems for simplicial complexes.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-25 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.22414 — 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-18T08:27:54.409Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).