Abstract

A graph G is k- divisible if for each induced subgraph H of G with at least one edge, there is a partition of the vertex set of H into sets V 1,…, V k such that no V i contains a maximum clique of H. We show that a claw-free graph is 2-divisible if and only if it does not contain an odd hole: we conjecture that this result is true for any graph, and present further conjectures relating 2-divisibility to the strong perfect graph conjecture. We also present related results involving the chromatic number and the stability number, with connections to Ramsey theory.

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 call

Disclaimer: 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.