Symmetry conjecture for graphs with edge-disjoint cycles
Statement
Let be a graph, and let denote its total oriented chromatic quasisymmetric function. Say that cycles of are edge-disjoint when no two cycles share an edge. Symmetry conjecture for edge-disjoint cycles. If no two cycles of share an edge, then is symmetric. The preceding theorem proves the corresponding identity for trees, while the conjectured extension to graphs whose cycles are pairwise edge-disjoint is not resolved in the supplied text.
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.