Eulerian edge-refinement conjecture for sphere embeddings

Let GG be a dd-sphere with d2d\geq 2 and let HH be a (d+1)(d+1)-sphere containing GG as a subgraph. An edge refinement inserts a vertex into an edge and joins it to the common neighbors of the edge's endpoints. A graph is Eulerian when the relevant simplex degrees are even.

Eulerian edge-refinement conjecture. It is possible to edge refine HH, using only edges different from those of GG, so that the modified HH becomes Eulerian.

The conjecture is proposed as a sufficient condition for the sphere coloring conjecture: an Eulerian host would provide a coloring of the embedded sphere with d+1d+1 or d+2d+2 colors. The source gives no resolution and notes that the higher-dimensional cases remain to be investigated.

Sources & referencesView supporting material

Primary source

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

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.