7 problems

Let $G$ be a random graph, and let $\gamma_{MB}(G,b)$ and $s_{MB}(G,b)$ denote the two Maker–Breaker domination game parameters. For a Binomial random graph $G_{n,p}$ with constant…

Three-sevenths upper-bound conjecture. For any graph $G$ with no $K_2$-components,

Improved SMBD-number bounds.

Consider a simple undirected graph $G$ with vertex set $V(G)$ and order $n=|V(G)|$. The game domination number $\gamma_g(G)$ is the value of the domination game on $G$ when Dominat…

Let $G$ be a graph. It is minimally $\gamma_g$-imperfect if $G$ is not $\gamma_g$-perfect, while every proper induced subgraph of $G$ is $\gamma_g$-perfect. The anti-holes…

Kinnersley–West–Zamani 3/5-conjecture.

Tree domination-game pair conjecture. No pair of the form $(k,k-1)$ can be realized by a tree.