Lower bounds for graph bootstrap percolation via properties of polynomials (Q2174952)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7193917
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds for graph bootstrap percolation via properties of polynomials |
scientific article; zbMATH DE number 7193917 |
Statements
Lower bounds for graph bootstrap percolation via properties of polynomials (English)
0 references
27 April 2020
0 references
bootstrap
0 references
percolation
0 references
graph bootstrap
0 references
0.8319474458694458
0 references
0.8297445178031921
0 references
0.8118802309036255
0 references
0.8086029291152954
0 references
0.8084567785263062
0 references
