Potentially \(K_{r_{1},r_{2},\dots ,r_{l},r,s}\)-graphic sequences
type: Item
instance of: scholarly article
title: Potentially \(K_{r_{1},r_{2},\dots ,r_{l},r,s}\)-graphic sequences
zbMATH Open document ID: 1119.05026
author: Jiongsheng Li
author: Jian-Hua Yin
published in: Discrete Mathematics
publication date: 2007-03-15T00:00:00Z
review text: The authors continue the study of a variation of a classical Turán-type extremal problem: determine the smallest even integer \(\sigma(K_{r_1,r_2,\dots, r_l,r,s},n)\) such that every \(n\)-term graphic sequence \(\pi= (d_1,d_2,\dots, d_n)\) with term sum \(\sigma(\pi)= d_1+ d_2+\cdots+ d_n\geq \sigma(K_{r_1,r_2,\dots, r_l,r,s},n)\) has a realization \(G\) containing \(K_{r_1,r_2,\dots, r_l,r,s}\) as a subgraph. The authors prove exact value of \(\sigma(K_{r_1,r_2,\dots, r_l,r,s},n)\) for sufficiently large \(n\), where \(r\geq 3\) (see Theorem 1.2).
reviewed by: Ferdinand Gliviak
Mathematics Subject Classification ID: 05C07
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 5134184
zbMATH Keywords: potentially graphic sequence
zbMATH Keywords: degree sequence
zbMATH Keywords: Turán-type problems
MaRDI profile type: Publication
full work available at URL: j.disc.2006.07.037
OpenAlex ID: W2025040813
cites work: Q3941433
cites work: Q3287781
cites work: Algorithms for constructing graphs and digraphs with given valences and factors
cites work: The smallest degree sum that yields potentially \(K_{r,r}\)-graphic sequences
cites work: An extremal problem on potentially \(K_{r,s}\)-graphic sequences
cites work: A variation of a classical Turán-type extremal problem
cites work: Q5463558
DOI: 10.1016/J.DISC.2006.07.037
description: scientific article; zbMATH DE number 5134184