Conjecture on chromatic core subgraphs of strong graph products
Statement
Let and be graphs, and let and be chromatic core subgraphs of and , respectively. The strong product has vertex set , with adjacency given by adjacency in either factor while the other coordinate is equal, or adjacency in both factors. Strong-product chromatic-core conjecture. The strong product is a chromatic core subgraph of . This conjecture is motivated in the source by standard bounds on the chromatic number of the strong product and by its relation to the tensor and Cartesian products. No resolution is supplied, so its status is 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.