Abstract
Abstract In this paper, for p ≥ 4 , we prove that the family of forbidden induced subgraphs for a graph G such that the clique graph of G is Kp-free is finite, providing a proof of a conjecture in [F. Protti and J. Szwarcfiter. Clique-Inverse Graphs of K3-free and K4-free Graphs, Journal of Graph Theory (2000) 257–272]. We also give an upper bound for the rank of Sperner conformal hypergraphs that contain p pairwise intersecting edges and are minimal with respect to all these properties.
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.
