The chromatic number of the product of two ℵ1-chromatic graphs can be countable

1985/06/01 by A. Hajnal · 20 citations
Mathematics · #Advanced Topology and Set Theory #Chromatic scale #Combinatorics #Countable set #Discrete mathematics #Geometry #Limits and Structures in Graph Theory #Mathematics #Product (mathematics)

paper · doi:10.1007/bf02579376

published in Combinatorica 5(2), 137-139 (Springer Science and Business Media LLC)

crossref issued 1985/06/01 · crossref published 1985/06/01 · crossref published-print 1985/06/01 · openalex publication_date 1985/06/01 · crossref created 2007/03/22 · crossref deposited 2019/05/18 · crossref indexed 2025/09/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29

Citations

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

Cited by

• On multiplicative graphs and the product conjecture
• Coloring graph products — A survey
• A SURVEY ON HEDETNIEMI'S CONJECTURE
• Hedetniemi's conjecture [wikipedia]