{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T18:07:57Z","timestamp":1777572477682,"version":"3.51.4"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>For a graph $G$ whose degree sequence is $d_{1},\\ldots ,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\u00e1n number of $H$. In this paper we consider the case $p&gt;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.<\/jats:p>","DOI":"10.37236\/1525","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T02:02:54Z","timestamp":1578708174000},"source":"Crossref","is-referenced-by-count":16,"title":["A Tur\u00e1n Type Problem Concerning the Powers of the Degrees of a Graph"],"prefix":"10.37236","volume":"7","author":[{"given":"Yair","family":"Caro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raphael","family":"Yuster","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2000,8,30]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v7i1r47\/comment","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v7i1r47\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T05:22:01Z","timestamp":1579324921000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v7i1r47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,8,30]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2000,1,1]]}},"URL":"https:\/\/doi.org\/10.37236\/1525","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,8,30]]},"article-number":"R47"}}