This conjecture concerns the general problem of estimating when phase transitions occur in systems. For example, in a random network with N nodes, where each edge is included with probability p , it is unlikely for the graph to contain a Hamiltonian cycle if p is less than a threshold value ( log ⁡ ⁡ N ) / N , but highly likely if p exceeds that threshold.