15 problems
Let be the complete graph on five vertices. Complete-graph conjecture. … The source presents this as a conjectural computational pattern and gives no resolution.
Let be the complete graph on four vertices. Complete-graph conjecture. For every , … The paper reports verification for , but does not establish the st…
Let denote the graph formed by gluing two triangles along an edge, and let denote the corresponding graph cohomology. Square-with-diagonal c…
For , let be the wheel graph, let be obtained by deleting an edge from its polygonal part, and let be obtained by deleting a spike edge. Wheel and…
Let be the complete graph on vertices, and let denote the width of the torsion in . Width conjecture for comple…
Let be the wheel graph, the cone over an -gon, and let denote the width of the torsion in . Width conjecture…
Let be the graph obtained by gluing a triangle and squares in a sequence along edges, and let denote the width of the torsion in…
Let be the graph obtained by gluing a triangle and squares in a sequence along edges, with vertices. Torsion formula for . … This is one of the…
Let be the graph with vertices obtained by gluing a triangle and a -gon along an edge. Let be the width of the torsion in…
Let be a graph, and let denote its graph cohomology associated with the algebra . A graph is loopless if it has no loops, and a cyc…
Let be the Kontsevich cycle indexed by nonnegative integers and , and let denote the corresponding modified kappa class. Write…
Nontriviality conjecture. For every , the element defines a non-trivial cohomology class in
Let be the graded space of canonical differential forms, let be the free Lie algebra on it, and let…
A finite graph is called naturally oriented if has a basis whose supports are isomorphic, in the orientation-preserving sense, to cycles whose edges all poin…
Let be the graph complex, and let denote its loop graphs. The partner classes are those classes killed by the loop graphs in the spectral sequence described i…