Complements of nearly perfect graphs

Abstract

A class of graphs closed under taking induced subgraphs is -bounded if there exists a function f such that for all graphs G in the class, (G) ≤ f(ω(G)). We consider the following question initially studied in [A. Gy\'arf\'as, Problems from the world surrounding perfect graphs, Zastowania Matematyki Applicationes Mathematicae, 19:413--441, 1987]. For a -bounded class C, is the class C -bounded (where C is the class of graphs formed by the complements of graphs from C)? We show that if C is -bounded by the constant function f(x)=3, then C is -bounded by g(x)=85x and this is best possible. We show that for every constant c>0, if C is -bounded by a function f such that f(x)=x for x ≥ c, then C is -bounded. For every j, we construct a class of graphs -bounded by f(x)=x+x/j(x) whose complement is not -bounded.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…