Abstract
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 [2].
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.