On Ramsey number \(R(4,3,3)\) and triangle-free edge-chromatic graphs in three colors

DOI10.1016/S0012-365X(96)00057-XzbMath0870.05050MaRDI QIDQ1356712

Konrad Piwakowski

Publication date: 11 September 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

coloringedge-chromatic graphsmulti-color Ramsey numberthree color Ramsey number

Mathematics Subject Classification ID

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

Related Items (1)

Computing the Ramsey number \(R(4,3,3)\) using abstraction and symmetry breaking

Cites Work

• Unnamed Item
• A simple construction giving the two non-isomorphic triangle-free 3-colored \(K_{16}\)'s
• A uniqueness theorem for edge-chromatic graphs
• On the maximal triangle-free edge-chromatic graphs in three colors
• Combinatorial Relations and Chromatic Graphs

This page was built for publication: On Ramsey number \(R(4,3,3)\) and triangle-free edge-chromatic graphs in three colors