Rainbow triangles and cliques in edge-colored graphs
Stefan Ehard, Elena Mohr

TL;DR
This paper establishes new minimum conditions involving edges and colors in edge-colored graphs that guarantee the existence of a specified number of rainbow triangles, providing tight bounds and characterizations.
Contribution
It introduces sharp bounds and characterizations for rainbow triangles in edge-colored graphs based on edges, colors, and vertex color degrees, answering open questions.
Findings
Minimum conditions for rainbow triangles based on edges and colors.
Characterization of extremal graphs for rainbow triangles.
Results are tight and optimal for large graphs.
Abstract
For an edge-colored graph, a subgraph is called rainbow if all its edges have distinct colors. We show that if is an edge-colored graph of order and size using colors on its edges, and for a non-negative integer , then contains at least rainbow triangles. For , we show that this result is best possible, and we completely characterize the class of edge-colored graphs for which this result is sharp. Furthermore, we show that an edge-colored graph contains at least rainbow triangles if where denotes the number of distinct colors incident to a vertex . Finally we characterize the edge-colored graphs without a rainbow clique of size at least six that maximize the sum of edges and colors . Our results answer two questions of Fujita, Ning,…
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.
