Sparse Multipartite Graphs as Partition Universal for Graphs of Bounded-Degrees

Abstract

For graphs $G$ and $H$, let $G\to (H,H)$ signify that any red/blue edge coloring of $G$ contains a monochromatic $H$ as a subgraph, and $\mathcal{H}(Δ,n)=\{H:|V(H)|=n,Δ(H)\le Δ\}$. For fixed $Δ$ and $n$, we say that $G$ is a partition universal graph for $\mathcal{H}(Δ,n)$ if $G\to (H,H)$ for every $H\in\mathcal{H}(Δ,n)$. In 1983, Chvátal, Rödl, Szemerédi and Trotter proved that for any $Δ\ge2$ there exists a constant $B$ such that, for any $n$, if $N\ge Bn$ then $K_N$ is partition universal for $\mathcal{H}(Δ,n)$. Recently, Kohayakawa, Rödl, Schacht and Szemerédi proved that the complete graph $K_N$ in above result can be replaced by sparse graphs. They obtained that for fixed $Δ\ge2$, there exist constants $B$ and $C$ such that if $N\ge Bn$ and $p=C(\log N/N)^{1/Δ}$, then {\bf a.a.s.} $G(N,p)$ is partition universal graph for $\mathcal{H}(Δ,n)$, where $G(N,p)$ is the standard random graph on $N$ vertices with $\mathbb{P}(e)=p$ for each edge $e$. From some results of Bollobás and Łuczak, we know that {\bf a.a.s.} $χ(G(N,p)) = Θ((N/\log N)^{1-1/Δ})$. In this paper, we shall show that the $G(N,p)$ in above result can be replaced by random multipartite graph. Let $K_{r}(N)$ be the complete $r$-partite graph with $N$ vertices in each part, and $G_r(N,p)$ the random spanning subgraph of $K_r(N)$, in which each edge appears with probability $p$. It is shown that for fixed $Δ\ge2$ there exist constants $r, B$ and $C$ depending only on $Δ$ such that if $N\ge Bn$ and $p=C(\log N/N)^{1/Δ}$, then {\bf a.a.s.} $G_r(N,p)$ is partition universal graph for $\mathcal{H}(Δ,n)$. The proof mainly uses the sparse multipartite regularity lemma.