5 problems

Beck–Csernenszky–Mándity–Pluhár conjecture. If Maker wins the Maker-Breaker game on $H$ while going second, then Waiter wins the Waiter-Client game on $H$.

A hypergraph is a pair consisting of a vertex set and a collection of subsets of that vertex set, called hyperedges. In the Tic-Tac-Toe game on a hypergraph, Maker wins if Maker ca…

$k$-SAT threshold conjecture. The threshold biases satisfy

Non-2-colourability threshold conjecture. The threshold biases satisfy

Chooser-Picker conjecture. If Breaker wins the Maker-Breaker game on ${\mathcal H}$, then Picker wins the Chooser-Picker game on ${\mathcal H}$.