Balogh–Morris–Samotij diameter-game threshold conjecture
Let and let be the Maker–Breaker game on the edges of in which Maker wins precisely when her spanning subgraph has diameter at most . Write for its threshold bias. Diameter-game threshold conjecture. The threshold bias is close to the bound for Breaker's side, namely the bound in part (b) of the stated theorem, of order . This conjecture concerns the asymptotic sharpness of the Breaker-side bound; the source does not specify an exact asymptotic equivalent or establish its resolution.
References
- Juri Barkey, Bruno Borchardt, Dennis Clemens, Milica Maksimović, Mirjana Mikalački and Miloš Stojaković, “Rainbow connectivity Maker-Breaker game”, arXiv:2603.09770 (2026).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.