A hierarchy of randomness for graphs

The first one is completely non-random, being the ordinary Ramsey-Turán problem and in the subsequent three problems we formulate some randomized variations of it. As we will show, these four levels form a hierarchy. In a continuation of this paper we shall prove some further theorems and discuss some further, related problems.