Hong-Liang Lü

Anti-Ramsey number of intersecting cliques

An edge-colored graph is called a rainbow graph if all its edges have distinct colors. The anti-Ramsey number a r ( n , G ) , for a graph G and a positive integer n , is defined as the minimum number of colors r such that every exact r -edge-coloring of the complete graph K n con...