Generalized saturation problems for cliques, paths, and stars

Jamie Radcliffe, Adam Volk

A graph $G$ is $F$-saturated if it does not contain any copy of $F$, but the addition of any missing edge in $G$ creates at least one copy of $F$. Inspired by work of Alon and Shik…