Abstract
AbstractLet be an edge‐colored graph on vertices. The minimum color degree of , denoted by , is defined as the minimum number of colors assigned to the edges incident to a vertex in . In 2013, Li proved that an edge‐colored graph on vertices contains a rainbow triangle if . In this paper, we obtain several estimates on the number of rainbow triangles through one given vertex in . As a consequence, we prove counting results for rainbow triangles in edge‐colored graphs. One main theorem states that the number of rainbow triangles in is at least , which is best possible by considering the rainbow ‐partite Turán graph, where its order is divisible by . This means that there are rainbow triangles in if , and rainbow triangles in if when . Both results are tight in the sense of the order of the magnitude. We also prove a counting version of a previous theorem on rainbow triangles under a color neighborhood union condition due to Broersma et al., and an asymptotically tight color degree condition forcing a colored friendship subgraph (i.e., rainbow triangles sharing a common vertex).
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.
