It's probably even worse than that, in that one probability isn't evidence of cheating, whether you have found the optimal dense subgraphs or not. The biggest

It's probably even worse than that, in that one probability isn't evidence of cheating, whether you have found the optimal dense subgraphs or not. The biggest I take from this (apart from it being an interesting analysis in itself) is that if there is an assumption of randomness in creation of CDO's that should be verified at creation.