On the chromatic number of some ($P_3\cup P_2$)-free graphs
Rui Li, Jinfeng Li, Di Wu

TL;DR
This paper investigates bounds on the chromatic number for certain ($P_3rac12$)free graphs, establishing new upper bounds for classes defined by additional forbidden subgraphs, and discusses $$-binding functions for specific graph classes.
Contribution
It provides new upper bounds on the chromatic number for ($P_3rac12$)-free graphs with additional forbidden subgraphs, advancing understanding of $$-boundedness in these classes.
Findings
$ heta(G)$ bound for ($P_3rac12$, kite)-free graphs
$ heta^2(G)$ bound for ($P_3rac12$, hammer)-free graphs
$(3 heta^2(G)+ heta(G))/2$ bound for ($P_3rac12$, $C_5$)-free graphs
Abstract
A hereditary class of graphs is {\em -bounded} if there is a {\em -binding function}, say , such that for every , where denotes the chromatic (clique) number of . It is known that for every -free graph , \cite{BA18}, and the class of -free graphs does not admit a linear -binding function\cite{BBS19}. In this paper, we prove that (\romannumeral 1) if is (, kite)-free, (\romannumeral 2) if is (, hammer)-free, (\romannumeral 3) if is ()-free. Furthermore, we also discuss -binding functions for -free graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNuclear Receptors and Signaling · Advanced Graph Theory Research · Limits and Structures in Graph Theory
