Planar graphs with separation are dp-minimal
Combinatorics
2022-05-23 v1 Logic
Abstract
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.
Cite
@article{arxiv.2205.10204,
title = {Planar graphs with separation are dp-minimal},
author = {Javier de la Nuez González},
journal= {arXiv preprint arXiv:2205.10204},
year = {2022}
}