Giant Rainbow Trees in Sparse Random Graphs

Tolson Bell, Alan Frieze

For any small constant $\epsilon >0$, the Erdős-Rényi random graph $G(n,\frac{1+\epsilon }{n})$ with high probability has a unique largest component which contains $(1\pm O(\epsilon ))2\epsilon n$ vertices. Let $…