Independent Sets in Graphs with an Excluded Clique Minor
Abstract
Let G be a graph with n vertices, with independence number α, and with with no Kt+1-minor for some t≥5. It is proved that (2α-1)(2t-5)≥2n-5.
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.