Generalized Ramsey theory for graphs

DOI10.1090/S0002-9904-1972-12927-6MaRDI QIDQ5642585zbMATH OpenFDO

Authors Vašek Chvátal, Frank Harary

Publication date 1972

Published in Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/S0002-9904-1972-12927-6

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Cites work

• scientific article; zbMATH DE number 3285073 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• scientific article; zbMATH DE number 3188526 (Why is no real title available?)
• On Chromatic Bipartite Graphs
• On Sets of Acquaintances and Strangers at any Party
• On the existence of specified cycles in complementary graphs
• Some remarks on the theory of graphs

Cited in

(12)

• A generalization of Ramsey theory for graphs
• The Ramsey numbers r(P\(_m\),K\(_n\))
• On three color Ramsey numbers \(R(C_4, C_4, K_{1, n})\)
• Path-star Ramsey numbers
• Generalised Ramsey numbers for small graphs
• Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete.
• On the 3-color Ramsey numbers R(C₄,C₄,W_n)
• On Ramsey numbers for linear forests
• A note on cycle Ramsey numbers
• Ramsey Graphs and Block Designs. I
• Ramsey Theorems for Multiple Copies of Graphs
• Gallai-Ramsey numbers for three graphs on at most five vertices

This page was built for publication: Generalized Ramsey theory for graphs

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