The generation conjecture for cycles in deleted graph products
Statement
Let be a graph and let be its deleted Cartesian square. Consider left cycles, right cycles, off-diagonal cycles, symmetrized cycles, triadic cycles, boundaries, symmetric -cycles, symmetrized boundaries, and symmetric off-diagonal cycles as defined in the source.
Cycle-generation conjecture. In :
(a) every -cycle is a sum of left cycles, right cycles, off-diagonal cycles, triadic cycles, and boundaries;
(b) every symmetric -cycle is a sum of off-diagonal cycles, triadic cycles, and boundaries;
(c) every symmetric -cycle is a sum of symmetric off-diagonal cycles, triadic cycles, and symmetrized boundaries.
Part (b) is accompanied by a reference to a proof in the source. The supplied text does not establish the status of parts (a) and (c), nor does it provide enough context to determine whether the displayed statement is intended as a conjecture or a restatement of a result; it is therefore recorded as open with low confidence.
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.