Degree sequence and independence in \(K(4)\)-free graphs (Q1894779): Difference between revisions

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\).