On Ramsey numbers for large disjoint unions of graphs
From MaRDI portal
DOI10.1016/0012-365X(88)90004-0zbMATH Open0647.05040MaRDI QIDQ1104338FDOQ1104338
Authors: Stefan A. Burr
Publication date: 1988
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
Cited In (13)
- The Ramsey numbers for disjoint unions of graphs
- Ramsey number of multiple copies of stars
- Ramsey numbers for a disjoint union of some graphs
- On the Ramsey numbers r(G,nH) and r(nG,nH) when n is large
- A Ramsey-type theorem for multiple disjoint copies of induced subgraphs
- Vertex partition of a complete multipartite graph into two kinds of induced subgraphs
- The Ramsey numbers for disjoint unions of trees
- The Ramsey numbers for disjoint unions of cycles
- On star-critical and upper size Ramsey numbers
- Ramsey numbers for multiple copies of hypergraphs
- Title not available (Why is that?)
- On zero sum Ramsey numbers: Multiple copies of a graph
- Title not available (Why is that?)
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)