Trivalent partner conjecture for loop graphs in odd graph cohomology

From papers

Let GC3\mathrm{GC}_3 be the graph complex, and let LkL_k denote its loop graphs. The partner classes are those classes killed by the loop graphs in the spectral sequence described in the source. Trivalent partner conjecture. The classes killed by the loop graphs LkL_k are linear combinations of trivalent graphs; equivalently, the corresponding classes live in degree 3-3 in GC3\mathrm{GC}_3. The conjecture concerns the currently unknown partners of the loop graphs; the source reports that computationally found non-loop classes occur in degrees 3-3 and 6-6, and gives no resolution.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Anton Khoroshkin, Thomas Willwacher and Marko Živković, “Differentials on graph complexes”, arXiv:1411.2369 (2015).

Solutions 0

No solutions have been posted yet.