Separating polynomial χ-boundedness from χ-boundedness

01/21/2022
by   Marcin Briański, et al.
0

Extending the idea from the recent paper by Carbonero, Hompe, Moore, and Spirkl, for every function fℕ→ℕ we construct a χ-bounded hereditary class of graphs 𝒞 with the property that for every integer n≥ 2 there is a graph in 𝒞 with clique number at most n and chromatic number at least f(n). In particular, this proves that there are hereditary classes of graphs that are χ-bounded but not polynomially χ-bounded.

READ FULL TEXT

page 1

page 2

page 3

research
10/01/2019

Graphs of bounded cliquewidth are polynomially χ-bounded

We prove that if C is a hereditary class of graphs that is polynomially ...
research
03/15/2018

Definable decompositions for graphs of bounded linear cliquewidth

We prove that for every positive integer k, there exists an MSO_1-transd...
research
09/12/2023

The χ-binding function of d-directional segment graphs

Given a positive integer d, the class d-DIR is defined as all those inte...
research
07/04/2023

An Optimal Multiple-Class Encoding Scheme for a Graph of Bounded Hadwiger Number

Since Jacobson [FOCS89] initiated the investigation of succinct graph en...
research
04/14/2023

Bounded Poincaré operators for twisted and BGG complexes

We construct bounded Poincaré operators for twisted complexes and BGG co...
research
03/20/2023

Bounded twin-width graphs are polynomially χ-bounded

We show that every graph with twin-width t has chromatic number O(ω ^k_t...
research
10/23/2020

Canonization for Bounded and Dihedral Color Classes in Choiceless Polynomial Time

In the quest for a logic capturing PTime the next natural classes of str...

Please sign up or login with your details

Forgot password? Click here to reset