The critical bias for the Hamiltonicity game is (1+o(1))n/ln n
classification
🧮 math.CO
keywords
gamehamiltonicitybiasbiasedcompletecriticaledgesenough
read the original abstract
We prove that in the biased 1:b Hamiltonicity Maker-Breaker game, played on the edges of the complete graph K_n, Maker has a winning strategy for b(n)<=(1-o(1))n/ln n, for all large enough n.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.