Saturation Number of Trees in the Hypercube

Kavish Gandhi, Chiheon Kim

A graph $H^{\prime }$ is $(H,G)$-saturated if it is $G$-free and the addition of any edge of $H$ not in $H^{\prime }$ creates a copy of $G$. The saturation number $sat(H,G)$ is the…