English

Diagonal Ramsey numbers in multipartite graphs related to stars

Combinatorics 2019-01-08 v1

Abstract

Let the star on nn vertices, namely K1,n1K_{1,n-1} be denoted by SnS_n. If every two coloring of the edges of a complete balanced multipartite graph Kj×sK_{j \times s} there is a copy of SnS_n in the first color or a copy of SmS_m in the second color, then we will say Kj×s(Sn,Sm)K_{j \times s}\rightarrow (S_n,S_m). The size Ramsey multipartite number mj(Sn,Sm)m_j(S_n, S_m) is the smallest natural number ss such that Kj×s(Sn,Sm)K_{j \times s}\rightarrow (S_n,S_m). In this paper, we obtain the exact values of the size Ramsey numbers mj(Sn,Sm)m_j(S_n,S_m) for n,m3n,m \ge 3 and j3j \ge 3.

Keywords

Cite

@article{arxiv.1901.01436,
  title  = {Diagonal Ramsey numbers in multipartite graphs related to stars},
  author = {C. J. Jayawardene},
  journal= {arXiv preprint arXiv:1901.01436},
  year   = {2019}
}

Comments

14 pages, 10 figures