For 20 edges, two out of three of our trials resulted in a det(ℱ ) of precisely zero, meaning that the generated graph is disconnected. This observation leads us to ask next: given fixed 𝑛, for what values of 𝑘 is a random design, 𝒢 (𝑛, 𝑘), likely to be connected?