A lower bound on independence in terms of degrees (Q548268): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2020061266 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Independence in connected graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the independence number of a graph in terms of order and size / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A lower bound on the independence number of a graph in terms of degrees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Clique is hard to approximate within \(n^{1-\epsilon}\) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Foreword: Special issue on stability in graphs and related topics / rank | |||
Normal rank | |||
Latest revision as of 06:10, 4 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound on independence in terms of degrees |
scientific article |
Statements
A lower bound on independence in terms of degrees (English)
0 references
28 June 2011
0 references
independence
0 references
stability
0 references
connected graph
0 references
