Hedetniemi's multiplicativity conjecture for non-k-colourable graphs
Statement
Let be the class of all graphs that are not -colourable. A class of graphs is multiplicative if it is closed under categorical products.
Hedetniemi's multiplicativity conjecture. For every positive integer , the class is multiplicative.
The source states this as an equivalent formulation of Hedetniemi's product conjecture. Its status is supplied as unknown, so the database records it as open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.