The chromatic number of the product of two \(\aleph _ 1\)-chromatic graphs can be countable

DOI10.1007/BF02579376zbMath0575.05029WikidataQ64356947 ScholiaQ64356947MaRDI QIDQ1063621

Andras Hajnal

Publication date: 1985

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

infinite graphchromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

On multiplicative graphs and the product conjecture, Lattices arising in categorial investigations of Hedetniemi's conjecture, Multiplicativity of acyclic digraphs, Coloring graph products---a survey, Hadwiger's conjecture for uncountable graphs, Maximal independent sets, variants of chain/antichain principle and cofinal subsets without AC, Hedetniemi's conjecture is asymptotically false, A complexity problem for Borel graphs, Hedetniemi's conjecture for uncountable graphs, Generic automorphisms and graph coloring, Counterexamples to Hedetniemi's conjecture, Multiplicativity of acyclic local tournaments, Borel chromatic numbers

Cites Work

• The chromatic number of the product of two 4-chromatic graphs is 4
• Unnamed Item