Combinatorial Morse flows are hard to find

We investigate the probability of detecting combinatorial Morse flows on a simplicial complex via a random search. We prove that it is really small, in a quantifiable way.