A note on the rainbow connection of random regular graphs (Q2401435)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A note on the rainbow connection of random regular graphs
scientific article

    Statements

    A note on the rainbow connection of random regular graphs (English)
    0 references
    0 references
    8 September 2017
    0 references
    Summary: 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 \textit{A. Dudek} et al. [SIAM J. Discrete Math. 29, No. 4, 2255--2266 (2015; Zbl 1325.05148)].
    0 references
    random regular graphs
    0 references

    Identifiers