Degree sequence and independence in \(K(4)\)-free graphs (Q1894779): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:17, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Degree sequence and independence in \(K(4)\)-free graphs |
scientific article |
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
