In a random graph, the number of paths that cannot be extended in an hamiltonian path, can be roughly be separated in two equal parts ?

In a random graph, the number of paths that cannot be further extended in an hamiltonian path or an hamiltonian cycle, can be roughly be separated in two equal parts? I have an idea for solve for...

08 January 2021 9,938 2 View