Metraipolis › archive › dc_976da81c2bee

Generalized Turán problems for shorter even cycles — arXiv:2609.37376

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.37376
License (as archived)
CC0-1.0
Archived
2026-10-07T18:33:39.913Z
SHA-256 of the archived text
7dd9b896d538b4eda57124b5275e847849865d0bc072b03a306b04ee4e8caa3f
Stable URL of this page
https://metraipolis.com/documento/dc_976da81c2bee

How to cite

Generalized Turán problems for shorter even cycles — arXiv:2609.37376 — arXiv (en), https://arxiv.org/abs/2609.37376 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_976da81c2bee (Metraipolis archive dc_976da81c2bee, sha256 7dd9b896d538b4eda57124b5275e847849865d0bc072b03a306b04ee4e8caa3f)
BibTeX
@misc{dc976da81c2bee,
  title = {Generalized Turán problems for shorter even cycles — arXiv:2609.37376},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.37376},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_976da81c2bee; sha256 7dd9b896d538b4eda57124b5275e847849865d0bc072b03a306b04ee4e8caa3f},
  year = {2026}
}

Archived text

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

For graphs $H$ and $F$, let $\text{ex}(n,H,F)$ denote the maximum number of copies of $H$ in an $n$-vertex $F$-free graph. Gerbner, Győri, Methuku, and Vizer proved that $\text{ex}(n,C_{2\ell},C_{2k})=\Theta(n^\ell)$ for $k>\ell\ge2$. They determined the leading term for $\ell=2$, but for $k>\ell\ge3$ their general lower and upper bounds had different leading constants, leaving open the problem of closing this gap. We solve this problem by showing that, for every $k>\ell\ge2$, \[\text{ex}(n,C_{2\ell},C_{2k})=\left(\frac{(k-1)_\ell}{2\ell}+o(1)\right)n^\ell, \] where $(k-1)_\ell=(k-1)(k-2)\cdots(k-\ell)$.

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