A note on potentially $K_4-e$ graphical sequences
| dc.creator | Lai, Chunhui | |
| dc.date | 2003-08-11 | |
| dc.date.accessioned | 2026-07-07T05:00:20Z | |
| dc.date.available | 2026-07-07T05:00:20Z | |
| dc.description | A sequence $S$ is potentially $K_4-e$ graphical if it has a realization containing a $K_4-e$ as a subgraph. Let $σ(K_4-e, n)$ denote the smallest degree sum such that every $n$-term graphical sequence $S$ with $σ(S)\geq σ(K_4-e, n)$ is potentially $K_4-e$ graphical. Gould, Jacobson, Lehel raised the problem of determining the value of $σ(K_4-e, n)$. In this paper, we prove that $σ(K_4-e, n)=2[(3n-1)/2]$ for $n\geq 7$, and $n=4,5,$ and $σ(K_4-e, 6)= 20$. | |
| dc.description | 5 pages | |
| dc.identifier | https://arxiv.org/abs/math/0308105 | |
| dc.identifier | http://arxiv.org/abs/math/0308105 | |
| dc.identifier | Australasian Journal of Combinatorics, 24(2001), 123-127 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/68296 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C07; 05C35 | |
| dc.title | A note on potentially $K_4-e$ graphical sequences | |
| dc.type | text |