Ramsey numbers of 3-uniform loose paths and loose cycles

From MaRDI portal
(Redirected from Publication:392807)




Abstract: Haxell et. al. [%P. Haxell, T. Luczak, Y. Peng, V. R"{o}dl, A. %Ruci'{n}ski, M. Simonovits, J. Skokan, The Ramsey number for hypergraph cycles I, J. Combin. Theory, Ser. A, 113 (2006), 67-83] proved that the 2-color Ramsey number of 3-uniform loose cycles on 2n vertices is asymptotically frac5n2. Their proof is based on the method of Regularity Lemma. Here, without using this method, we generalize their result by determining the exact values of 2-color Ramsey numbers involving loose paths and cycles in 3-uniform hypergraphs. More precisely, we prove that for every ngeqmgeq3, R(mathcalPn3,mathcalPm3)=R(mathcalPn3,mathcalCm3)=R(mathcalCn3,mathcalCm3)+1=2n+lfloorfracm+12floor and for n>mgeq3, R(mathcalPm3,mathcalCn3)=2n+lfloorfracm12floor. These give a positive answer to a question of Gy'{a}rf'{a}s and Raeisi [The Ramsey number of loose triangles and quadrangles in hypergraphs, Electron. J. Combin. 19 (2012), #R30].




Cited in
(30)






This page was built for publication: Ramsey numbers of 3-uniform loose paths and loose cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q392807)