Tree-independence number VII. Excluding a star
Abstract
We prove that for every fixed integer s and every planar graph H, the class of H-induced-minor-free and K1,s-induced-subgraph-free graphs has polylogarithmic tree-independence number. This is a weakening of a conjecture of Dallard, Krnc, Kwon, Milanic, Munaro, Storgel, and Wiederrecht.
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.