From Eq. 13, the expected number of edges for a minimally connected design is less than or equal to 𝑛 ⋅ ln(𝑛). Since this relationship is a lower bound, adding more edges than 𝑛 ⋅ ln(𝑛) is unlikely to increase 𝑐. Below the lower bound in equation 13, as we observed in our experiment on random graph generation (Fig. ), the probability of generating disconnected seed designs increases.