4 problems

Maximum-degree gap conjecture. For every graph $G$ and every configuration $x$,

Universal half-order gap conjecture. The difference satisfies

Tree gap conjecture.

Let an $m \times n$ chessboard be equipped with the $sigma^-$-game using the $boxtimes$-neighborhood, in which squares sharing an edge or a corner are neighbors. The all-on configu…