A lower bound on the independence number of a graph in terms of degrees and local clique sizes (Q298956)
From MaRDI portal
| File:Ambox important.svg | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A lower bound on the independence number of a graph in terms of degrees and local clique sizes |
scientific article; zbMATH DE number 6595946
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound on the independence number of a graph in terms of degrees and local clique sizes |
scientific article; zbMATH DE number 6595946 |
Statements
A lower bound on the independence number of a graph in terms of degrees and local clique sizes (English)
0 references
21 June 2016
0 references
independent set
0 references
chromatic number
0 references
clique
0 references
