arXiv · 1901.01436
Diagonal Ramsey numbers in multipartite graphs related to stars
Abstract
Let the star on $n$ vertices, namely $K_{1,n-1}$ be denoted by $S_n$. If every two coloring of the edges of a complete balanced multipartite graph $K_{j \times s}$ there is a copy of $S_n$ in the first color or a copy of $S_m$ in the second color, then we will say $K_{j \times s}\rightarrow (S_n,S_m)$. The size Ramsey multipartite number $m_j(S_n, S_m)$ is the smallest natural number $s$ such that $K_{j \times s}\rightarrow (S_n,S_m)$. In this paper, we obtain the exact values of the size Ramsey numbers $m_j(S_n,S_m)$ for $n,m \ge 3$ and $j \ge 3$.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
C. J. Jayawardene. 2019-01-05. Diagonal Ramsey numbers in multipartite graphs related to stars. https://arxiv.org/abs/1901.01436
Cite the original work for its findings. Save a collection to share your selection of sources.