Degree sequence and independence in \(K(4)\)-free graphs
type: Item
instance of: scholarly article
title: Degree sequence and independence in \(K(4)\)-free graphs
zbMATH Open document ID: 0833.05074
DOI: 10.1016/0012-365X(94)E0224-6
author: Talmage James Reid
author: William Staton
author: Ralph Faudree
author: R. H. Schelp
author: P. Erdős
published in: Discrete Mathematics
publication date: 1996-03-05T00:00:00Z
review text: This paper deals with the question whether \(K_r\)-free, \(r\geq 3\), graphs with few repetitions in the degree sequence may have independence number \(o(n)\). The five authors succeed in settling the cases \(r= 3\) and \(r\geq 5\), and give partial results for \(r= 4\).
Mathematics Subject Classification ID: 05C99
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 778543
zbMATH Keywords: degree sequence
zbMATH Keywords: independence number
reviewed by: Rainer Bodendiek
MaRDI profile type: Publication
cites work: On a Ramsey-Turán type problem
cites work: Graph Theory and Probability
cites work: Degree sequences in triangle-free graphs
cites work: Q4401979
full work available at URL: 0012-365x(94)e0224-6
OpenAlex ID: W2042794444
description: scientific article; zbMATH DE number 778543