On the Ramsey numbers r(G,nH) and r(nG,nH) when n is large

DOI10.1016/0012-365X(87)90053-7zbMath0621.05024MaRDI QIDQ1090340

Stefan A. Burr

Publication date: 1987

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Ramsey numberdisjoint copies

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Related Items (8)

What can we hope to accomplish in generalized Ramsey theory ? ⋮ On Ramsey numbers for large disjoint unions of graphs ⋮ On zero sum Ramsey numbers: Multiple copies of a graph ⋮ The Ramsey numbers for disjoint unions of cycles ⋮ A large tree is \(tK_m\)-good ⋮ A Ramsey-type theorem for multiple disjoint copies of induced subgraphs ⋮ Vertex partition of a complete multipartite graph into two kinds of induced subgraphs ⋮ Ramsey number of multiple copies of stars

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ramsey numbers for all linear forests
• Ramsey numbers for quadrangles and triangles
• Parallel concepts in graph theory
• Diagonal Ramsey numbers for small graphs
• Ramsey Theorems for Multiple Copies of Graphs
• Generalized Ramsey Theory for Graphs. II. Small Diagonal Numbers

This page was built for publication: On the Ramsey numbers r(G,nH) and r(nG,nH) when n is large