A note on the rainbow connection of random regular graphs

作者：Molloy Michael^*

来源：Electronic Journal of Combinatorics, 2017, 24(3): P3.49.

DOI：10.37236/6789

We prove that a random 3-regular graph has rainbow connection number O(log n). This completes the remaining open case from Rainbow connection of random regular graphs, by Dudek, Frieze and Tsourakakis.

• 出版日期2017-9-8