Eulerian edge-refinement conjecture for discrete spheres

From papers

Let a dd-sphere be a finite simple graph whose unit spheres are (d1)(d-1)-spheres and which becomes contractible after deleting a suitable vertex. An edge refinement is the operation of inserting a vertex into an edge and connecting it to the common neighbors of the edge's endpoints. A graph is Eulerian when the degrees of its relevant simplices are even.

Eulerian edge-refinement conjecture. dd-spheres have edge refinements which are Eulerian.

The statement is proposed as a higher-dimensional extension of the result that every 22-sphere admits edge refinements making it Eulerian. The source specifically says that the corresponding higher-dimensional bootstrapping remains to be established.

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

Oliver Knill, “Eulerian edge refinements, geodesics, billiards and sphere coloring”, arXiv:1808.07207 (2018).

Solutions 0

No solutions have been posted yet.