Metraipolis › archive › dc_581c8ded3770
On degree powers in the degenerate Turán problem — arXiv:2608.08838
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.08838
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T09:08:58.903Z
- SHA-256 of the archived text
8b9b02cffb3729284852d1442cbde1a446117380fc54fb196123b1e3ed25f438- Stable URL of this page
https://metraipolis.com/documento/dc_581c8ded3770
How to cite
On degree powers in the degenerate Turán problem — arXiv:2608.08838 — arXiv (en), https://arxiv.org/abs/2608.08838 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_581c8ded3770 (Metraipolis archive dc_581c8ded3770, sha256 8b9b02cffb3729284852d1442cbde1a446117380fc54fb196123b1e3ed25f438)
BibTeX
@misc{dc581c8ded3770,
title = {On degree powers in the degenerate Turán problem — arXiv:2608.08838},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.08838},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_581c8ded3770; sha256 8b9b02cffb3729284852d1442cbde1a446117380fc54fb196123b1e3ed25f438},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.08838. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Given a graph $G$ with degree sequence $d_{1},\ldots,d_{n}$ and a positive real number $p$, let $e_{p}(G)=\sum_{i=1}^{n} d_{i}^{p}$. For a fixed family of graphs $\mathcal F$, let $ex_{p}(n, \mathcal F)$ denote the maximum value of $e_{p}(G)$ over all $\mathcal F$-free graphs $G$ on $n$ vertices. In 2000, Caro and Yuster introduced the following Turán-type problem: For a positive integer $p$ and a fixed graph $F$, determine $ex_{p}(n, F)$, and characterize the extremal graphs $G$ on $n$ vertices that attain $ex_p(n, F)$. Recently, Gao, Liu, Ma and Pikhurko proved that $ex_{p}(n, \mathcal F)=(\tau(\mathcal F)-1+o(1))n^p$ for real $p>\frac{1}{1-\alpha}$, where $\mathcal F$ is a degenerate family of graphs with classical Turán number $ex(n, \mathcal F)=O(n^{1+\alpha})$ for some $\alpha\in[0,1)$, and $\tau(\mathcal F)$ is the minimum size of an independent vertex cover over all bipartite graphs $F\in\mathcal F$. Based on their method, we obtain a stability result for $ex_{p}(n, \mathcal F)$, and prove that all extremal graphs must contain the complete bipartite graph $K_{\tau(\mathcal F)-1,n-\tau(\mathcal F)+1}$ when $n$ is sufficiently large. Our results can be used to deduce all previously known results about $ex_{p}(n, F)$ when $F$ is a bipartite graph and $n$ is sufficiently large. We also obtain several new exact results for $ex_{p}(n, F)$, namely, when $F$ is an even cycle, a complete bipartite graph, a discrete hypercube, a caterpillar forest, and a spider forest.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-11 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.08838 — 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-19T09:05:33.574Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).