A note on extendable sets of colorings and rooted minors
Abstract
DeVos and Seymour (2003) proved that for every set C of 3-colorings of a set X of vertices, there exists a plane graph G with vertices of X incident with the outer face such that a 3-coloring of X extends to a 3-coloring of G if and only if it belongs to C. We prove a generalization of this claim for k-colorings of X-rooted-Kk+1-minor-free Kk+2-minor-free graphs.
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.