Diagonal Ramsey numbers of loose cycles in uniform hypergraphs

DOI10.1137/16M1077647MaRDI QIDQ5348216zbMATH OpenFDO

Authors G. R. Omidi, M. Shahsiah

Publication date 14 August 2017

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

loose cycleloose pathRamsey numberuniform hypergraph

Mathematics Subject Classification ID

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

Abstract: A $k$-uniform loose cycle $mathcal{C}_n^k$ is a hypergraph with vertex set $v_1,v_2,ldots,v_{n(k-1)}$ and with the set of $n$ edges $e_i=v_{(i-1)(k-1)+1},v_{(i-1)(k-1)+2},ldots,v_{(i-1)(k-1)+k}$, $1leqileqn$, where we use mod $n(k-1)$ arithmetic. The Ramsey number $R(mathcal{C}_n^k,mathcal{C}_n^k)$ is asymptotically $frac12(2k-1)n$ as has been proved by Gy'{a}rf'{a}s, S'{a}rk"{o}zy and Szemer'{e}di. In this paper, we investigate to determining the exact value of diagonal Ramsey number of $mathcal{C}_n^k$ and we show that for $ngeq2$ and $kgeq8$ ${\displaystyle }$R(mathcal{C}^k_n,mathcal{C}^k_n)=(k-1)n+lfloorfrac{n-1}{2} floor.${\displaystyle }$

Recommendations

• Ramsey numbers of 5-uniform loose cycles
• The Ramsey number of loose cycles versus cliques
• The Ramsey number for hypergraph cycles. I.
• Ramsey numbers of uniform loose paths and cycles
• The Ramsey number of diamond-matchings and loose cycles in hypergraphs

Cites work

• 3-uniform hypergraphs of bounded degree have linear Ramsey numbers
• All Ramsey numbers for cycles in graphs
• Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs
• scientific article; zbMATH DE number 3262254 (Why is no real title available?)
• On the Ramsey number of sparse 3-graphs
• Path-cycle Ramsey numbers
• Ramsey numbers for cycles in graphs
• Ramsey numbers of 3-uniform loose paths and loose cycles
• Ramsey numbers of sparse hypergraphs
• Ramsey numbers of uniform loose paths and cycles
• The Ramsey number for a triple of long even cycles
• The Ramsey number for hypergraph cycles. I.
• The Ramsey number of diamond-matchings and loose cycles in hypergraphs
• The Ramsey number of loose paths in 3-uniform hypergraphs
• The Ramsey number of loose triangles and quadrangles in hypergraphs
• Three-color Ramsey numbers for paths

Cited in

(4)

• Ramsey numbers of 5-uniform loose cycles
• Ramsey numbers of 4-uniform loose cycles
• Cover \(k\)-uniform hypergraphs by monochromatic loose paths
• Constrained Ramsey numbers for the loose path, cycle and star

This page was built for publication: Diagonal Ramsey numbers of loose cycles in uniform hypergraphs

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