Abstract
AbstractIn this paper we show that every (, diamond)‐free graph satisfies , where and are the chromatic number and clique number of , respectively. Our bound is attained by the complement of the famous 27‐vertex Schläfli graph. Our result unifies previously known results on the existence of linear ‐binding functions for several graph classes. Our proof is based on a reduction via the Strong Perfect Graph Theorem to imperfect (, diamond)‐free graphs, a careful analysis of the structure of those graphs, and a computer search that relies on a well‐known characterization of 3‐colourable ‐free graphs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
