ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG and HH be graphs, and let G′G' and H′H' be chromatic core subgraphs of GG and HH, respectively. The strong product G⊠HG\boxtimes H has vertex set V(G)×V(H)V(G)\times V(H), 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 G′⊠H′G'\boxtimes H' is a chromatic core subgraph of G⊠HG\boxtimes H. 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.