A strict upper bound for size multipartite Ramsey numbers of paths versus stars
<p>Let $P_n$ represent the path of size $n$. Let $K_{1,m-1}$ represent a star of size $m$ and be denoted by $S_{m}$. Given a two coloring of the edges of a complete graph $K_{j \times s}$ we say that $K_{j \times s}\rightarrow (P_n,S_{m+1})$ if there is a copy of $P_n$ in the first color or a...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
InaCombS; Universitas Jember; dan Universitas Indonesia
2017-08-01
|
| Series: | Indonesian Journal of Combinatorics |
| Subjects: | |
| Online Access: | http://www.ijc.or.id/index.php/ijc/article/view/15 |