Six-cycle spanning conjecture for the F4 diagrammatic category
Statement
Let be the diagrammatic category for type , with generating object . A graph is component-planar if each of its connected components is a planar graph. For , consider component-planar graphs from to whose cycles all have length at least six.
Six-cycle spanning conjecture. For , these component-planar graphs span
This proposes a restricted spanning family for every hom-space in the diagrammatic category, replacing graphs with shorter cycles by linear combinations of graphs satisfying the six-cycle condition. The source presents this as a conjecture; no resolution is supplied.
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.