The Electronic Journal of Combinatorics · 2013 · 19 citations · 5 references
Natural SciencesMathematicsCombinatoricsCombinatorial Number TheoryEnumerative CombinatoricsGraph ColoringGraph TheoryHypergraph TheoryRamsey TheoryAsymptotic PropertiesHypergraph Ramsey NumbersHypergraph Ramsey TheoryMulticolor Ramsey NumbersRamsey GraphsRamsey MultiplicityRamsey PropertyRamsey-type Theorems
Recently, asymptotic values of 2-color Ramsey numbers for loose cycles and also loose paths were determined. Here we determine the 2-color Ramsey number of $3$-uniform loose paths when one of the paths is significantly larger than the other: for every $n\geq \Big\lfloor\frac{5m}{4}\Big\rfloor$, we show that $$R(\mathcal{P}^3_n,\mathcal{P}^3_m)=2n+\Big\lfloor\frac{m+1}{2}\Big\rfloor.$$
5
Stanisław Radziszowski · The Electronic Journal of Combinatorics · 2011 · 430 citations · Full text
Edy Tri Baskoro · Mathematika · 2009 · 141 citations
The Ramsey number for hypergraph cycles I
Penny Haxell, Tomasz Łuczak, Yuejian Peng et al. · Journal of Combinatorial Theory Series A · 2005 · 62 citations