Three-color Ramsey numbers of \(K _{n }\) dropping an edge

DOI10.1007/s00373-011-1069-3zbMath1256.05147OpenAlexW2007812667MaRDI QIDQ1926024

Yusheng Li, Lin Dong, Chang-Xiang He

Publication date: 27 December 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-011-1069-3

zbMATH Keywords

Ramsey numberedge coloringcomplete graphdropping an edge

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (1)

Lower bounds for \(r_2(K_1 + G)\) and \(r_3(K_1 + G)\) from Paley graph and generalization

Cites Work

• A construction for Ramsey numbers for \(K_{m,n}\)
• Lower bounds for Ramsey numbers and association schemes

This page was built for publication: Three-color Ramsey numbers of \(K _{n }\) dropping an edge