1 problem

A graph is called forcing if it is $p$-forcing for every $0<p<1$, where a graph $H$ is $p$-forcing when, for every graph sequence of edge density tending to $p$, the condition…