Abstract
Let G be a tripartite graph with N vertices in each vertex class. If each vertex is adjacent to at least (2/3) N vertices in each of the other classes, then either G contains a subgraph that consists of N vertex-disjoint triangles or G is a specific graph in which each vertex is adjacent to exactly (2/3) N vertices in each of the other classes.
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.
