Abstract
A collection of sets is intersecting, if any pair of sets in the collection has nonempty intersection. A collection of sets has the Helly property if any intersecting subcollection has nonempty intersection. A graph G is Helly if the collection of maximal complete subgraphs of G has the Helly property. We prove that if G is a k-regular graph with n vertices such that n>3k+2k2−k, then the complement G‾ is not Helly. We also consider the problem of whether the properties of Hellyness and convergence under the clique graph operator are equivalent for the complement of k-regular graphs, for small values of k.
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.
