English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

A Gallai coloring is a coloring of the edges of a complete graph withoutrainbow triangles, and a Gallai $k$-coloring is a Gallai coloring that uses atmost $k$ colors. Given an integer $k\ge1$ and graphs $H_1, \ldots, H_k$, theGallai-Ramsey number $GR(H_1, \ldots, H_k)$ is the least integer $n$ such thatevery Gallai $k$-coloring of the complete graph $K_n$ contains a monochromaticcopy of $H_i$ in color $i$ for some $i \in \{1,2, \ldots, k\}$. When $H = H_1 =\cdots = H_k$, we simply write $GR_k(H)$. We study Gallai-Ramsey numbers ofeven cycles and paths. For all $n\ge3$ and $k\ge2$, let $G_i=P_{2i+3}$ be apath on $2i+3$ vertices for all $i\in\{0,1, \ldots, n-2\}$ and$G_{n-1}\in\{C_{2n}, P_{2n+1}\}$. Let $ i_j\in\{0,1,\ldots, n-1 \}$ for all$j\in\{1,2, \ldots, k\}$ with $ i_1\ge i_2\ge\cdots\ge i_k $. The first authorrecently conjectured that $ GR(G_{i_1}, G_{i_2}, \ldots, G_{i_k}) =|G_{i_1}|+\sum_{j=2}^k i_j$. The truth of this conjecture implies that$GR_k(C_{2n})=GR_k(P_{2n})=(n-1)k+n+1$ for all $n\ge3$ and $k\ge1$, and$GR_k(P_{2n+1})=(n-1)k+n+2$ for all $n\ge1$ and $k\ge1$. In this paper, weprove that the aforementioned conjecture holds for $n\in\{3,4\}$ and all$k\ge2$. Our proof relies only on Gallai's result and the classical Ramseynumbers $R(H_1, H_2)$, where $H_1, H_2\in\{C_8, C_6, P_7, P_5, P_3\}$. Webelieve the recoloring method we developed here will be very useful for solvingsubsequent cases, and perhaps the conjecture.

A conjecture on Gallai-Ramsey numbers of even cycles and paths