
Problem
Determine .
Given graphs and
, let
denote the minimum number of edges in a subgraph
of
such that the edges of
can be added to
, one edge at a time, so that each edge completes a copy of
when it is added.
Of course, if one can solve the problem above, then a natural next step is to determine for all
and
.
Morrison, Noel and Scott [MNS] solved the related problem of determining for all
and
.
Bibliography
[MNS] N. Morrison, J. A. Noel, A. Scott. Saturation in the hypercube and bootstrap percolation. To appear in Combin. Probab. Comput.
* indicates original appearance(s) of problem.