Pollyanna and Polynomially \c{hi}-Bounded Graph Classes
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866908835949576192 |
|---|---|
| author | Rahimi, Narjes Mojdeh, D. A. |
| author_facet | Rahimi, Narjes Mojdeh, D. A. |
| contents | A hereditary graph class is called polynomially $χ$-bounded if there exists a polynomial function $f$ such that $χ(G) \le f(ω(G))$ for every induced subgraph $G$. A class $\mathcal{C}$ is called Pollyanna if, for every $χ$-bounded class $\mathcal{F}$, the class $\mathcal{C} \cap \mathcal{F}$ is polynomially $χ$-bounded.
In the paper by Chudnovsky et al., \emph{Reuniting $χ$-boundedness with polynomial $χ$-boundedness} (J.\ Combin.\ Theory Ser.\ B 176 (2026), 30--73), the authors posed twelve problems and one conjecture concerning the Pollyanna framework. In this work, we investigate several of these problems by studying the chromatic number of hereditary graph classes defined by forbidden induced subgraphs.
We prove three new strong Pollyanna results. In particular, for every $t \ge 2$, every $\{\text{diamond}, \mathrm{hammer}(t)^+\}$-free graph is $t$-strongly Pollyanna. We also show that graph classes obtained by forbidding suitable combinations of bowties and dumbbells are $(2t-2)$-strongly Pollyanna.
We show that the class of $\{(2,2)$-bowtie, $P_5$, $(3,3)$-dumbbell$\}$-free graphs is polynomially $χ$-bounded. We also prove polynomial $χ$-boundedness for diamond-free graphs in which every edge lies in at least two triangles, under additional forbidden configurations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_14542 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Pollyanna and Polynomially \c{hi}-Bounded Graph Classes Rahimi, Narjes Mojdeh, D. A. Combinatorics A hereditary graph class is called polynomially $χ$-bounded if there exists a polynomial function $f$ such that $χ(G) \le f(ω(G))$ for every induced subgraph $G$. A class $\mathcal{C}$ is called Pollyanna if, for every $χ$-bounded class $\mathcal{F}$, the class $\mathcal{C} \cap \mathcal{F}$ is polynomially $χ$-bounded. In the paper by Chudnovsky et al., \emph{Reuniting $χ$-boundedness with polynomial $χ$-boundedness} (J.\ Combin.\ Theory Ser.\ B 176 (2026), 30--73), the authors posed twelve problems and one conjecture concerning the Pollyanna framework. In this work, we investigate several of these problems by studying the chromatic number of hereditary graph classes defined by forbidden induced subgraphs. We prove three new strong Pollyanna results. In particular, for every $t \ge 2$, every $\{\text{diamond}, \mathrm{hammer}(t)^+\}$-free graph is $t$-strongly Pollyanna. We also show that graph classes obtained by forbidding suitable combinations of bowties and dumbbells are $(2t-2)$-strongly Pollyanna. We show that the class of $\{(2,2)$-bowtie, $P_5$, $(3,3)$-dumbbell$\}$-free graphs is polynomially $χ$-bounded. We also prove polynomial $χ$-boundedness for diamond-free graphs in which every edge lies in at least two triangles, under additional forbidden configurations. |
| title | Pollyanna and Polynomially \c{hi}-Bounded Graph Classes |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2602.14542 |