@Article{AAM-34-4,
author = {Liu, Erxiong},
title = {Ramsey Number of Hypergraph Paths},
journal = {Annals of Applied Mathematics},
year = {2018},
volume = {34},
number = {4},
pages = {383--394},
abstract = {<p style="text-align: justify;">Let $H = (V, E)$ be a $k$-uniform hypergraph. For $1 ≤ s ≤ k − 1,$ an $s$-path $P^{(k,s)}_n$ of length $n$ in $H$ is a sequence of distinct vertices&nbsp;<span style="text-align: justify;">$v_1, v_2, · · · , v_{s+n(k−s)}$</span> such that $\{v_{1+i(k-s)}, \cdots, v_{s+(i+1)(k-s)}\}$ is an edge of $H$ for each $0 ≤ i ≤ n−1.$ In this paper, we prove that $R(P^ {(3s,s)}_n , P^{(3s,s)}_3) = (2n + 1)s + 1$ for $n ≥ 3.$</p>},
issn = {},
doi = {https://doi.org/2018-AAM-20586},
url = {https://global-sci.com/article/72730/ramsey-number-of-hypergraph-paths}
}