Javier de la Nuez González·2022-05-20·via math.CO updates on arXiv.org
We prove that given a planar embedding of a graph in the sphere the expansion of the graph structure by predicates encoding separation of vertices by simple cycles of the graph is dp-minimal.