Ramsey numbers for graph sets versus complete graphs

MaRDI QIDQ2785715zbMATH OpenFDO

Authors Ralph Faudree, Heiko Harborth, Ingrid Mengersen

Publication date 25 February 1997

Published in Utilitas Mathematica (Search for Journal in Brave)

zbMATH Keywords

set Ramsey number

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Recommendations

• Ramsey numbers for sets of small graphs
• scientific article; zbMATH DE number 426345
• scientific article; zbMATH DE number 887766

Cited in

(13)

• Ramsey numbers for sets of small graphs
• On book-complete graph Ramsey numbers
• Ramsey for complete graphs with a dropped edge or a triangle
• Ramsey's theorem and self-complementary graphs
• scientific article; zbMATH DE number 5942217 (Why is no real title available?)
• scientific article; zbMATH DE number 426345 (Why is no real title available?)
• Ramsey unsaturated and saturated graphs
• Off‐diagonal and asymptotic results on the Ramsey number r(K_2,m,K_2,n)
• Changing views of Ramsey numbers
• The Cycle-Complete Graph Ramsey Numbers
• scientific article; zbMATH DE number 834108 (Why is no real title available?)
• A lower bound for set‐coloring Ramsey numbers
• On Ramsey numbers for special complete distance graphs

This page was built for publication: Ramsey numbers for graph sets versus complete graphs

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