Year: 2018
Author: Erxiong Liu
Annals of Applied Mathematics, Vol. 34 (2018), Iss. 4 : pp. 383–394
Abstract
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 $v_1, v_2, · · · , v_{s+n(k−s)}$ 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.$
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/2018-AAM-20586
Annals of Applied Mathematics, Vol. 34 (2018), Iss. 4 : pp. 383–394
Published online: 2018-01
AMS Subject Headings: Global Science Press
Copyright: COPYRIGHT: © Global Science Press
Pages: 12
Keywords: hypergraph Ramsey number path.