Saturation in the hypercube and bootstrap percolation
Let Qd denote the hypercube of dimension d. Given d ⩾ m, a spanning subgraph G of Qd is said to be (Qd , Qm )-saturated if it does not contain Qm as a subgraph but adding any edge of E(Qd )\E(G) creates a copy of Qm in G. Answering a question of Johnson and Pinto [27], we show that for every fixed m...
| Main Authors: | , , |
|---|---|
| Formato: | Journal article |
| Publicado em: |
Cambridge University Press
2016
|