Ramsey numbers for graphs with five vertices

DOI10.1002/JGT.3190130210zbMath0676.05062OpenAlexW1978203268MaRDI QIDQ3831047

George R. T. Hendry

Publication date: 1989

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190130210

zbMATH Keywords

Ramsey numbergraphs on five vertices

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Related Items (19)

On Ramsey numbers of complete graphs with dropped stars ⋮ All missing Ramsey numbers for trees versus the four-page book ⋮ Generalized Ramsey numbers through adiabatic quantum optimization ⋮ The Ramsey numbers of large cycles versus wheels ⋮ Gallai-Ramsey numbers for graphs with five vertices of chromatic number four ⋮ Ramsey numbers \(r(K_ 3,G)\) for connected graphs \(G\) of order seven ⋮ Gallai-Ramsey numbers for a class of graphs with five vertices ⋮ All Ramsey numbers for five vertices and seven or eight edges ⋮ SMALL RAMSEY NUMBERS II: CRITICAL COLOURINGS FORr(C₅+ e,K₅) ⋮ Gallai-Ramsey numbers for graphs with chromatic number three ⋮ Star-critical Ramsey number of \(F_n\) versus \(K_4\) ⋮ The Ramsey numbers of large cycles versus odd wheels ⋮ \(R(C_6,K_5)=21\) and \(R(C_7,K_5)=25\) ⋮ The Ramsey number for a cycle of length five vs. a complete graph of order six ⋮ Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs ⋮ A note on Gallai-Ramsey number of even wheels ⋮ Size Ramsey results for the path of order three ⋮ Unnamed Item ⋮ Ramsey numbers for sets of small graphs

Cites Work

• Unnamed Item
• All Ramsey numbers for five vertices and seven or eight edges
• A uniqueness theorem for edge-chromatic graphs
• Generalized Ramsey theory for graphs. III: Small off-diagonal numbers
• Construction of Special Edge-Chromatic Graphs
• Combinatorial Relations and Chromatic Graphs

This page was built for publication: Ramsey numbers for graphs with five vertices