A note on the rainbow connection of random regular graphs (Q2401435)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on the rainbow connection of random regular graphs |
scientific article; zbMATH DE number 6772921
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the rainbow connection of random regular graphs |
scientific article; zbMATH DE number 6772921 |
Statements
A note on the rainbow connection of random regular graphs (English)
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
0.8874039649963379
0 references
0.8519271016120911
0 references
0.8455144762992859
0 references
0.8289191722869873
0 references
0.8197060823440552
0 references
