A non-hereditary Pollyanna class that is not strongly Pollyanna
Abstract
Chudnovsky, Cook, Davies, and Oum introduced the notion of Pollyanna graph classes: a class C is Pollyanna if for every χ-bounded class F, the intersection C F is polynomially χ-bounded. They further defined C to be strongly Pollyanna if it is k-strongly Pollyanna for some integer k, meaning that C F is polynomially χ-bounded for every k-good class F. They asked whether there are Pollyanna graph classes that are not strongly Pollyanna. In this note we answer this question affirmatively, under the literal interpretation that graph classes are not required to be hereditary. We construct a class C that is Pollyanna but, for every k 1, is not k-strongly Pollyanna; in particular C is not strongly Pollyanna.
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.