Abstract
For given k-uniform hypergraphs \({\mathcal {G}}\) and \({\mathcal {H}}\), the Ramsey number \(R({\mathcal {G}},{\mathcal {H}})\) is the smallest positive integer N such that in every red-blue coloring of the edges of the complete k-uniform hypergraph on n vertices there is either a red copy of \({\mathcal {G}}\) or a blue copy of \({\mathcal {H}}\). In this paper, results are given which permit the \(R(m{\mathcal {G}},n{\mathcal {H}})\) to be evaluated exactly when m or n is large and \({\mathcal {G}}\) is a k-uniform hypergraph with the maximum independent set that intersects each edge in \(k-1\) vertices and \({\mathcal {H}}\) is a k-uniform hypergraph with a vertex so that the hypergraph induced by the edges containing this vertex is a star. There are several examples for such \({\mathcal {G}}\) and \({\mathcal {H}}\), among them are any disjoint union of k-uniform hypergraphs involving loose paths, loose cycles, tight paths, tight cycles, stars, Kneser hypergraphs and complete k-uniform k-partite hypergraphs for \({\mathcal {G}}\) and linear hypergraphs for \({\mathcal {H}}\). As an application, \(R(m{\mathcal {G}},n{\mathcal {H}})\) is determined when m or n is large and \({\mathcal {G}}\), \({\mathcal {H}}\) are either loose paths, loose cycles, tight paths or stars. Moreover, for given k-uniform hypergraphs \({\mathcal {G}}\) and \({\mathcal {H}}\) and positive integers m, n, some bounds are given for \(R(m{\mathcal {G}},n{\mathcal {H}})\) which enable us to compute \(R(m{\mathcal {G}},n{\mathcal {H}})\) when \(m\ge n\ge 1\) and \({\mathcal {G}}, {\mathcal {H}}\) are either 3-uniform loose path \({\mathcal {P}}_r^3\) or loose cycle \({\mathcal {C}}_r^3\): We shall show that for every \(m\ge n\ge 1\) and \(r\ge s\), \(R(m{\mathcal {C}}_r^3,n{\mathcal {C}}_s^3)=2rm+\Big \lfloor \frac{s+1}{2}\Big \rfloor n-1,\) and \(R(m{\mathcal {P}}_r^3,n{\mathcal {P}}_s^3)=(2r+1)m+\Big \lfloor \frac{s+1}{2}\Big \rfloor n-1.\)
Similar content being viewed by others
References
Alon, N., Frankl, P., Lovász, L.: The chromatic number of Kneser hypergraphs. Trans. Am. Math. Soc. 298(1), 359–370 (1986)
Burr, S.A., Erdős, P., Spencer, J.H.: Ramsey theorems for multiple copies of graphs. Trans. Am. Math. Soc. 209, 87–99 (1975)
Burr, S.A.: On the Ramsey numbers \(r(G, nH)\) and \(r(nG, nH)\) when \(n\) is large. Discrete Math. 65(3), 215–229 (1987)
Burr, S.A.: On Ramsey numbers for large disjoint unions of graphs. Discrete Math. 70(3), 277–293 (1988)
Gerencsér, L., Gyárfás, A.: On Ramsey-type problems. Ann. Univ. Sci. Bp. Eötvös Sect. Math. 10, 167–170 (1967)
Gyárfás, A., Raeisi, G.: The Ramsey number of loose triangles and quadrangles in hypergraphs. Electron. J. Comb. 19, #P30 (2012)
Gyárfás, A., Sárközy, G.N., Szemerédi, E.: The Ramsey number of diamond-matchings and loose cycles in hypergraphs. Electron. J. Comb. 15(1), #R126 (2008)
Haxell, P.E., Łuczak, T., Peng, Y., Rödl, V., Ruciński, A., Simonovits, M., Skokan, J.: The Ramsey number for hypergraph cycles I. J. Comb. Theory Ser. A 113(1), 67–83 (2006)
Haxell, P.E., Łuczak, T., Peng, Y., Rödl, V., Ruciński, A., Skokan, J.: The Ramsey number for 3-uniform tight hypergraph cycles. Comb. Probab. Comput. 18(1–2), 165–203 (2009)
Maherani, L., Omidi, G.R, Raeisi, G., Shahsiah, M.: The Ramsey number of loose paths in 3-uniform hypergraphs. Electron. J. Comb. 20(1), #P12 (2013)
Omidi, G.R., Shahsiah, M.: Ramsey numbers of 3-uniform loose paths and loose cycles. J. Comb. Theory Ser. A 121, 64–73 (2014)
Radziszowski, S.P.: Ramsey numbers involving cycles. In: Soifer, A. (ed.) Ramsey Theory: Yesterday, Today, and Tomorrow, pp. 41–62. Springer, Berlin (2011)
Ramsey, F.P.: On a problem of formal logic. Proc. Lond. Math. Soc. 30, 264–286 (1930)
Acknowledgements
The authors would like to thank the anonymous referees for their valuable comments that improved the quality of the manuscript. The research of the second author was in part supported by a grant from IPM No. 1403050321.
Funding
The authors have not disclosed any funding.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no Conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Omidi, G.R., Raeisi, G. Ramsey Numbers for Multiple Copies of Hypergraphs. Graphs and Combinatorics 40, 133 (2024). https://doi.org/10.1007/s00373-024-02862-w
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00373-024-02862-w