Degree sequence and independence in \(K(4)\)-free graphs (Q1894779): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On a Ramsey-Turán type problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graph Theory and Probability / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Degree sequences in triangle-free graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4401979 / rank | |||
Normal rank | |||
Latest revision as of 15:54, 23 May 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
