A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
The Maker-Breaker connectivity game on a complete graph K n or on a random graph G ∼ G n,p is well studied by now. Recently, London and Pluhár suggested a variant in which Maker always needs to choose her edges in such a way that her graph stays connected. It follows from their results that for this connected version of the game, the threshold bias on K n and the threshold probability on G ∼ G n,p for winning the game drastically differ from the corresponding values for the usual Maker-Breakerdoi:10.15480/882.3667 fatcat:4j2kjg4yljdjdiz5ohvjlrlm2y