Structural conjecture for planar graph complexes
Structural conjecture for planar graph complexes
Let be a connected planar graph. A cube complex is a chain complex
indexed by the vertices of an -dimensional hypercube. For a vertex , write and let be its star subcomplex. Let denote the complex associated with , and let be a handle map. Structural conjecture. There exists a cube complex such that
This is intended to describe a uniform structure for the complex associated with every connected planar graph. The source gives no evidence of a resolution, so the conjecture remains open.
Sources & referencesView supporting material
Primary source
Benjamin Cooper, Matt Hogancamp and Vyacheslav Krushkal, “SO(3) Homology of Graphs and Links”, arXiv:1012.3672 (2010).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.