4 problems

Let $H_{n,p;k}$ be the random $k$-uniform hypergraph in which each of the $\binom{n}{k}$ edges appears independently with probability $p=d/n^{k-1}$, where $d$ is sufficiently large…

Subforest preservation conjecture. There exists a subforest $F'\subseteq F$ such that

Let $B_{n,p}$ denote the random bipartite graph with edge-probability parameter $p$, and let $\chi_g(B_{n,p})$ denote its game chromatic number. Random bipartite graph game chromat…

Let $G_{n,p}$ be the random graph on $n$ vertices in which each edge is present independently with probability $p$, and let $\chi_g(G_{n,p})$ denote its game chromatic number. For…