Simple Graphs of Order 12 and Minimum Degree 6 Contain K6 Minors
Abstract
We prove that every simple graph of order 12 which has minimum degree 6 contains a K6 minor.
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.