Planar graphs with separation are dp-minimal
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.