The smallest degree sum that yields potentially $C_k$-graphical sequence
| dc.creator | Lai, Chunhui | |
| dc.date | 2002-06-06 | |
| dc.date | 2004-08-22 | |
| dc.date.accessioned | 2026-07-07T04:48:55Z | |
| dc.date.available | 2026-07-07T04:48:55Z | |
| dc.description | In this paper we consider a variation of the classical Turán-type extremal problems. Let $S$ be an $n$-term graphical sequence, and $σ(S)$ be the sum of the terms in $S$. Let $H$ be a graph. The problem is to determine the smallest even $l$ such that any $n$-term graphical sequence $S$ having $σ(S)\ge l$ has a realization containing $H$ as a subgraph. Denote this value $l$ by $σ(H, n)$. We show $σ(C_{2m+1}, n)=m(2n-m-1)+2$, for $m\ge 3$, $n\ge 3m$; $σ(C_{2m+2}, n)=m(2n-m-1)+4$, for $m\ge 3, n\ge 5m-2$. | |
| dc.description | 8 pages | |
| dc.identifier | https://arxiv.org/abs/math/0206048 | |
| dc.identifier | http://arxiv.org/abs/math/0206048 | |
| dc.identifier | Journal of Combinatorial Mathematics and Combinatorial Computing 49 (2004), 57-64 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/64233 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C07, 05C35 | |
| dc.title | The smallest degree sum that yields potentially $C_k$-graphical sequence | |
| dc.type | text |