Hedetniemi's irreducibility conjecture for complete graphs
Statement
Let denote the complete graph on vertices. A relational structure is irreducible when, whenever , one has or .
Hedetniemi's irreducibility conjecture. The complete graph is irreducible for every positive integer .
The source gives this as another equivalent formulation of Hedetniemi's product conjecture. Its status is supplied as unknown, so it is recorded 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.