Three-color Ramsey number of an odd cycle versus bipartite graphs with small bandwidth

Chunlin You, Qizhong Lin

A graph $\mathcal{H}=(W,E_{\mathcal{H}})$ is said to have {\em bandwidth} at most $b$ if there exists a labeling of $W$ as $w_1,w_2,\dots ,w_n$ such that $|i-j|\le b$ for every edge…