Asymptotic value of the minimal size of a graph with rainbow connection number 2

TL;DR

This paper determines the asymptotic minimal number of edges in large graphs with rainbow connection number 2, revealing it grows roughly as n log n, and characterizes minimal graphs for vertex rainbow connection.

Contribution

It provides the exact asymptotic value of the minimal edges for graphs with rainbow connection number 2 and characterizes minimal graphs for vertex rainbow connection number d.

Findings

Asymptotic ratio of minimal edges to n log n is 1 for rainbow connection number 2.

Minimal edges for vertex rainbow connection number d is n-1 for d ≥ 2.

Characterization of graphs achieving minimal edges for vertex rainbow connection number d.

Abstract

A path in an edge (vertex)-colored graph $G$, where adjacent edges (vertices) may have the same color, is called a rainbow path if no pair of edges (internal vertices) of the path are colored the same. The rainbow (vertex) connection number $rc(G)$ ($rvc(G)$) of $G$ is the minimum integer $i$ for which there exists an $i$-edge (vertex)-coloring of $G$ such that every two distinct vertices of $G$ are connected by a rainbow path. Denote by $\mathcal{G}_d(n)$ ($\mathcal{G'}_d(n)$) the set of all graphs of order $n$ with rainbow (vertex) connection number $d$, and define $e_d(n)=\min\{e(G)\,|\, G\in \mathcal{G}_d(n)\}$ ($e_d'(n)=\min\{e(G)\,|\, G\in \mathcal{G'}_d(n)\}$), where $e(G)$ denotes the number of edges in $G$. In this paper, we investigate the bounds of $e_2(n)$ and get the exact asymptotic value. i.e., $\displaystyle \lim_{n\rightarrow \infty}\frac{e_2(n)}{n\log_2 n}=1$. Meanwhile, we obtain $e'_d(n)=n-1$ for $d\geq 2$, and the equality holds if and only if $G$ is such a graph such that deleting all leaves of $G$ results in a tree of order $d$.