Degree sequence and independence in \(K(4)\)-free graphs (Q1894779)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 778543
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Degree sequence and independence in \(K(4)\)-free graphs |
scientific article; zbMATH DE number 778543 |
Statements
Degree sequence and independence in \(K(4)\)-free graphs (English)
0 references
5 March 1996
0 references
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\).
0 references
degree sequence
0 references
independence number
0 references
0.8965935111045837
0 references
0.8961958289146423
0 references
0.8390829563140869
0 references
0.8354977369308472
0 references
0.810158908367157
0 references
