Let G and H be two graphs and let r(G,H) denote the Ramsey number defined as follows: r(G,H) is the smallest positive integer p so that, if the edges of the complete graph on p vertices are colored with two colors then either there is a subgraph isomorphic to G with all of its edges colored with the first color or a subgraph isomorphic to H with all of its edges colored with the second color. In this paper, the authors compute the exact values for \(r(C_ 4\cup C_ m\), \(C_ 4\cup C_ n)\), \(r(mC_ n\), \(mC_ 4)\), \(r(m(C_ 3\cup C_ 4)\), \(n(C_ 3\cup C_ 4))\) for most values of m and n.
- All Ramsey numbers for cycles in graphs
- scientific article; zbMATH DE number 3625415 (Why is no real title available?)
- scientific article; zbMATH DE number 3262254 (Why is no real title available?)
- On a Ramsey-type problem of J. A. Bondy and P. Erdős. II
- Ramsey numbers for cycles in graphs
- Ramsey numbers for quadrangles and triangles
- Ramsey Theorems for Multiple Copies of Graphs
- Ramsey numbers based on \(C_ 5\)-decompositions
- Local Ramsey numbers for copies of cycles
- The Ramsey numbers for disjoint unions of cycles
- Gallai-Ramsey numbers for multiple triangles
- Ramsey and Gallai-Ramsey numbers for two classes of unicyclic graphs
- Computation of the Ramsey numbers \(R(C_4,K_9)\) and \(R(C_4,K_{10})\)
- Computation of some generalized Ramsey numbers
- scientific article; zbMATH DE number 5714321 (Why is no real title available?)
- scientific article; zbMATH DE number 5630198 (Why is no real title available?)
- On zero sum Ramsey numbers: Multiple copies of a graph
- scientific article; zbMATH DE number 2065951 (Why is no real title available?)
- Cycles Are Strongly Ramsey-Unsaturated
- Ramsey numbers of multiple copies of graphs in a component
- Ramsey and 2-local Ramsey numbers for disjoint unions of cycles
This page was built for publication: Ramsey numbers for unions of some cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1097901)
