A Turán Type Problem Concerning the Powers of the Degrees of a Graph (revised)
| dc.creator | Caro, Y. | |
| dc.creator | Yuster, R. | |
| dc.date | 2004-01-28 | |
| dc.date.accessioned | 2026-07-07T05:04:56Z | |
| dc.date.available | 2026-07-07T05:04:56Z | |
| dc.description | For a graph $G$ whose degree sequence is $d_{1},..., d_{n}$, and for a positive integer $p$, let $e_{p}(G)=\sum_{i=1}^{n}d_{i}^{p}$. For a fixed graph $H$, let $t_{p}(n,H)$ denote the maximum value of $e_{p}(G)$ taken over all graphs with $n$ vertices that do not contain $H$ as a subgraph. Clearly, $t_{1}(n,H)$ is twice the Turán number of $H$. In this paper we consider the case $p>1$. For some graphs $H$ we obtain exact results, for some others we can obtain asymptotically tight upper and lower bounds, and many interesting cases remain open. | |
| dc.description | 14 Pages | |
| dc.identifier | https://arxiv.org/abs/math/0401398 | |
| dc.identifier | http://arxiv.org/abs/math/0401398 | |
| dc.identifier | The Electronic Journal of Combinatorics 7 (2000), #R47 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/69997 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C35; 05C07 | |
| dc.title | A Turán Type Problem Concerning the Powers of the Degrees of a Graph (revised) | |
| dc.type | text |