Rainbow triangles in edge-colored graphs
Binlong Li, Bo Ning, Chuandong Xu, Shenggui Zhang

TL;DR
This paper establishes conditions based on color degree, color number, and edge number that guarantee the existence of rainbow triangles in edge-colored graphs, confirming a conjecture by Li and Wang.
Contribution
It provides new sufficient conditions for rainbow triangle existence and confirms a previously proposed conjecture in the field.
Findings
Sufficient conditions for rainbow triangles based on color degree and number
Confirmation of Li and Wang's conjecture
Enhanced understanding of rainbow triangle existence criteria
Abstract
Let be an edge-colored graph. The color degree of a vertex of , is defined as the number of colors of the edges incident to . The color number of is defined as the number of colors of the edges in . A rainbow triangle is one in which every pair of edges have distinct colors. In this paper we give some sufficient conditions for the existence of rainbow triangles in edge-colored graphs in terms of color degree, color number and edge number. As a corollary, a conjecture proposed by Li and Wang (Color degree and heterochromatic cycles in edge-colored graphs, European J. Combin. 33 (2012) 1958--1964) is confirmed.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
