There seems to be a mysterious and exciting analogy between the evolution of random graphs and biased positional games on the complete graphs. The purpose of this paper is to point out two known instances of this analogy, and then to prove a theorem providing a third instance. The theorem concerns a game that involves hamiltonian graphs (see Theorem 3.B below). This paper can be considered as Part II of .
All Science Journal Classification (ASJC) codes