scientific article; zbMATH DE number 4047709

MaRDI QIDQ3784062zbMATH OpenFDO

Authors Lajos Soukup

Publication date 1988

Full work available at URL https://eudml.org/doc/17591

zbMATH Keywords

consistencyGCHproducts of infinite graphs

Mathematics Subject Classification ID

Consistency and independence results (03E35) Coloring of graphs and hypergraphs (05C15)

Recommendations

• The chromatic number of the product of two \(\aleph _ 1\)-chromatic graphs can be countable
• Hedetniemi's conjecture for uncountable graphs
• scientific article; zbMATH DE number 1239597
• scientific article; zbMATH DE number 426350
• Chromatic numbers and products

Cited in

(10)

• The chromatic number of the product of two \(\aleph _ 1\)-chromatic graphs can be countable
• On the b-chromatic number of Cartesian products
• Coloring graph products---a survey
• Chromatic numbers and products
• Dichromatic polynomial of product digraphs
• scientific article; zbMATH DE number 5778120 (Why is no real title available?)
• On the chromatic number of the product of graphs
• scientific article; zbMATH DE number 165094 (Why is no real title available?)
• The consistency of ZFC + 2^ℵ₀ > ℵ_ω + ℐ(ℵ₂) = ℐ(ℵ_ω)
• Hedetniemi's conjecture for uncountable graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3784062)