Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs (Q3525555)
From MaRDI portal
 | 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: Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs |
scientific article; zbMATH DE number 5344645
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs |
scientific article; zbMATH DE number 5344645 |
Statements
Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs (English)
0 references
17 September 2008
0 references
0.9668947458267212
0 references
0.8580769300460815
0 references
0.8535370826721191
0 references
0.8498512506484985
0 references
0.8423238396644592
0 references
