Ramsey numbers of 3-uniform loose paths and loose cycles

DOI10.1016/J.JCTA.2013.09.003zbMATH Open1279.05051arXiv1211.5800OpenAlexW2002542897WikidataQ114162733 ScholiaQ114162733MaRDI QIDQ392807FDOQ392807

Authors: G. R. Omidi, M. Shahsiah 

Publication date: 15 January 2014

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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(mathcal{P}_n^3,mathcal{P}_m^3)=R(mathcal{P}_n^3,mathcal{C}_m^3)=R(mathcal{C}_n^3,mathcal{C}_m^3)+1=2n+lfloorfracm+12floor$ and for $n>mgeq3$, $R(mathcal{P}_m^3,mathcal{C}_n^3)=2n+lfloorfracm-12floor$. 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].

Full work available at URL: https://arxiv.org/abs/1211.5800

Recommendations

• Ramsey numbers of uniform loose paths and cycles
• The Ramsey number of loose paths in 3-uniform hypergraphs
• The Ramsey number of 3-uniform loose path versus star
• The 3-colored Ramsey number for a 3-uniform loose path of length 3
• The Ramsey number for hypergraph cycles. I.

zbMATH Keywords

uniform hypergraphRamsey numberloose cycleloose path

Mathematics Subject Classification ID

Paths and cycles (05C38) Generalized Ramsey theory (05C55) Hypergraphs (05C65)

Cites Work

• Title not available (Why is that?)
• Three-color Ramsey numbers for paths
• The Ramsey number for a triple of long even cycles
• All Ramsey numbers for cycles in graphs
• Ramsey numbers for cycles in graphs
• Ramsey numbers of sparse hypergraphs
• Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs
• On the Ramsey number of sparse 3-graphs
• 3-uniform hypergraphs of bounded degree have linear Ramsey numbers
• The Ramsey number of diamond-matchings and loose cycles in hypergraphs
• Path-cycle Ramsey numbers
• The Ramsey number of loose paths in 3-uniform hypergraphs
• On a Ramsey-type problem of J. A. Bondy and P. Erdős. I
• The Ramsey number of loose triangles and quadrangles in hypergraphs
• The Ramsey number for hypergraph cycles. I.

Cited In (26)

• The Ramsey number of loose triangles and quadrangles in hypergraphs
• One more Turán number and Ramsey number for the loose 3-uniform path of length three
• The Ramsey number for hypergraph cycles. I.
• The Ramsey number of diamond-matchings and loose cycles in hypergraphs
• The Ramsey number of generalized loose paths in hypergraphs
• On multicolor Ramsey numbers for loose \(k\)-paths of length three
• Diagonal Ramsey Numbers of Loose Cycles in Uniform Hypergraphs
• \((k-2)\)-linear connected components in hypergraphs of rank \(k\)
• The Ramsey number of loose paths in 3-uniform hypergraphs
• A proof of a conjecture of Gyárfás, Lehel, Sárközy and Schelp on Berge-cycles
• Constrained Ramsey numbers for the loose path, cycle and star
• Multicolor Ramsey numbers and restricted Turán numbers for the loose 3-uniform path of length three
• Refined Turán numbers and Ramsey numbers for the loose 3-uniform path of length three
• Gallai-Ramsey numbers for 3-uniform rainbow Berge triangles and monochromatic linear paths or cycles
• Ramsey numbers of 5-uniform loose cycles
• The 3-colour Ramsey number of a 3-uniform Berge cycle
• Ramsey numbers for multiple copies of hypergraphs
• Monochromatic Hamiltonian Berge-cycles in colored hypergraphs
• Ramsey numbers of 4-uniform loose cycles
• Ramsey numbers of uniform loose paths and cycles
• The Ramsey number of 3-uniform loose path versus star
• Cover \(k\)-uniform hypergraphs by monochromatic loose paths
• On the multicolor Ramsey number for 3-paths of length three
• \(k\)-centric Turán numbers and multi-color Ramsey numbers for a loose 3-uniform path of length 3
• The Ramsey number for 3-uniform tight hypergraph cycles
• Constructive Methods in Gallai-Ramsey Theory for Hypergraphs

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)