On Ramsey numbers for large disjoint unions of graphs
From MaRDI portal
(Redirected from Publication:1104338)
Let \({\mathcal G}\) denote a fixed finite set of connected graphs. This paper contains results which, in principle, enable one to evaluate the Ramsey number r(G,H) when G and H are sufficiently large disjoint unions of graphs taken from \({\mathcal G}\). Using this result the author computes: \[ r(mK_ k,nK_ h)=(k-1)m+hn+r(K_{k-1},K_{h-1})-2 \] when m and n are sufficiently large with \(m\leq n\).
Recommendations
Cites work
Cited in
(15)- Ramsey numbers for a disjoint union of some graphs
- On the Ramsey numbers r(G,nH) and r(nG,nH) when n is large
- The Ramsey numbers for disjoint unions of cycles
- Ramsey number of multiple copies of stars
- A Ramsey-type theorem for multiple disjoint copies of induced subgraphs
- scientific article; zbMATH DE number 3869371 (Why is no real title available?)
- scientific article; zbMATH DE number 5714321 (Why is no real title available?)
- scientific article; zbMATH DE number 1208729 (Why is no real title available?)
- On zero sum Ramsey numbers: Multiple copies of a graph
- On star-critical and upper size Ramsey numbers
- Ramsey numbers for multiple copies of hypergraphs
- Ramsey numbers of generalized fans versus multiple cliques
- The Ramsey numbers for disjoint unions of trees
- The Ramsey numbers for disjoint unions of graphs
- Vertex partition of a complete multipartite graph into two kinds of induced subgraphs
This page was built for publication: On Ramsey numbers for large disjoint unions of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104338)
