Three color Ramsey number of K_ 4-e

DOI10.1016/0012-365X(91)90122-IMaRDI QIDQ804597zbMATH OpenFDO

Authors Geoffrey Exoo

Publication date 1991

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(91)90122-I

zbMATH Keywords

Ramsey number

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Recommendations

• Three color Ramsey numbers for graphs with at most 4 vertices
• scientific article; zbMATH DE number 1161386
• Three-color Ramsey numbers of \(K _{n }\) dropping an edge
• scientific article; zbMATH DE number 3910430
• On Some Multicolor Ramsey Numbers Involving K₃+e and K₄-e

Cites work

• scientific article; zbMATH DE number 3882465 (Why is no real title available?)
• scientific article; zbMATH DE number 4043886 (Why is no real title available?)
• scientific article; zbMATH DE number 3011797 (Why is no real title available?)
• A survey of bounds for classical Ramsey numbers
• Combinatorial Relations and Chromatic Graphs
• Generalised Ramsey numbers for small graphs
• Lower bounds for Ramsey numbers and association schemes
• On a combinatorial generalization of 27 lines associated with a cubic surface
• Parallel concepts in graph theory
• Strongly regular graphs

Cited in

(9)

• scientific article; zbMATH DE number 2192153 (Why is no real title available?)
• On Some Multicolor Ramsey Numbers Involving K₃+e and K₄-e
• Ramsey and Gallai-Ramsey numbers of cycles and books
• On some open questions for Ramsey and Folkman numbers
• Three-color Ramsey numbers of \(K _{n }\) dropping an edge
• Some three-color Ramsey numbers, R(P₄,P₅,C_k) and R(P₄,P₆,C_k)
• Bounds on small Ramsey numbers by semidefinite programming
• Three color Ramsey numbers for graphs with at most 4 vertices
• Semidefinite programming and Ramsey numbers

This page was built for publication: Three color Ramsey number of \(K_ 4-e\)

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