Ramsey numbers for a disjoint union of good graphs

DOI10.1016/J.DISC.2009.12.001zbMATH Open1215.05110OpenAlexW2083888362MaRDI QIDQ968423FDOQ968423

Authors: Halina Bielak 

Publication date: 5 May 2010

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

Full work available at URL: https://doi.org/10.1016/j.disc.2009.12.001

Recommendations

• Ramsey numbers for a disjoint union of some graphs
• The Ramsey numbers for disjoint unions of graphs
• scientific article; zbMATH DE number 5872084
• The Ramsey number for a forest versus disjoint union of complete graphs
• scientific article; zbMATH DE number 5714321

zbMATH Keywords

treeforestcomplete graphRamsey number\(g\)-good graph

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Cites Work

• All Ramsey numbers for cycles in graphs
• Title not available (Why is that?)
• The Ramsey numbers for disjoint unions of trees
• Ramsey numbers for a disjoint union of some graphs
• On the Ramsey Number r(F, K_m) Where F is a Forest

Cited In (6)

• Ramsey numbers for a disjoint union of some graphs
• On the Ramsey number for cycle with respect to identical copies of complete graphs
• A note on the Ramsey number for cycle with respect to multiple copies of wheels
• Corrigendum to: ``Trees and \(n\)-good hypergraphs
• The Ramsey number for a forest versus disjoint union of complete graphs
• Title not available (Why is that?)

This page was built for publication: Ramsey numbers for a disjoint union of good graphs

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