Chromatic Ramsey numbers

DOI10.1016/S0012-365X(98)00047-8zbMath0955.05073MaRDI QIDQ1584391

Xuding Zhu

Publication date: 2 November 2000

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

zbMATH Keywords

chromatic numberHedetniemi's conjecturechromatic Ramsey number

Mathematics Subject Classification ID

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

Related Items (8)

Degree Ramsey Numbers of Graphs ⋮ Degree Ramsey numbers for even cycles ⋮ Chromatic number is Ramsey distinguishing ⋮ Turán numbers of several bipartite graphs ⋮ The fractional version of Hedetniemi's conjecture is true ⋮ Degree bipartite Ramsey numbers ⋮ The chromatic Ramsey number of odd wheels ⋮ The Size Ramsey Number of Graphs with Bounded Treewidth

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The chromatic number of the product of two 4-chromatic graphs is 4
• On multiplicative graphs and the product conjecture
• Multiplicativity of acyclic local tournaments
• Mutiplicativity of oriented cycles
• A survey on Hedetniemi's conjecture
• On the chromatic number of the product of graphs
• On the Nonmultiplicativity of Oriented Cycles
• An approach to hedetniemi's conjecture

This page was built for publication: Chromatic Ramsey numbers