Constrained graph processes
Constrained graph processes
Let $\mathcal{Q}$ be a monotone decreasing property of graphs $G$ on $n$ vertices. Erdős, Suen and Winkler [5] introduced the following natural way of choosing a random maximal graph in $\mathcal{Q}$: start with $G$ the empty graph on $n$ vertices. Add edges to $G$ one at a time, each time …