Existence conjecture for edge-colour complements of transversal graphs
Statement
Let and let be the real representation of the Clifford algebra. A transversal graph is an induced complete subgraph on vertices whose edges represent pairs of basis matrices with disjoint support; the edges are coloured by amicability and anti-amicability. Transversal-graph colour-complement existence conjecture. If a graph exists among the transversal graphs, then there exists at least one graph whose edge colours are complementary to those of . This asserts existence of a colour-complementary transversal graph for every existing transversal graph; no resolution is given in the supplied material.
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.