Eulerian edge-refinement conjecture for sphere embeddings
Eulerian edge-refinement conjecture for sphere embeddings
Let be a -sphere with and let be a -sphere containing 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 , using only edges different from those of , so that the modified 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 or 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
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.