Ramsey numbers for multiple copies of hypergraphs

DOI10.1007/S00373-024-02862-WMaRDI QIDQ6650727

Ghaffar Raeisi, G. R. Omidi

Publication date: 9 December 2024

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

hypergraphRamsey numberloose cycleloose path

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Cites Work

• Title not available (Why is that?)
• Ramsey numbers of 3-uniform loose paths and loose cycles
• The Ramsey number of loose triangles and quadrangles in hypergraphs
• The Ramsey number for hypergraph cycles. I.
• The Ramsey number of diamond-matchings and loose cycles in hypergraphs
• On the Ramsey numbers r(G,nH) and r(nG,nH) when n is large
• On Ramsey numbers for large disjoint unions of graphs
• On a problem of formal logic.
• The Ramsey number of loose paths in 3-uniform hypergraphs
• Ramsey Numbers Involving Cycles
• The Ramsey Number for 3-Uniform Tight Hypergraph Cycles
• The Chromatic Number of Kneser Hypergraphs
• Ramsey Theorems for Multiple Copies of Graphs

This page was built for publication: Ramsey numbers for multiple copies of hypergraphs

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