Sharp concentration of the rainbow connection of random graphs

MaRDI QIDQ3099279zbMATH OpenFDO

Authors Yilun Shang

Publication date 1 December 2011

Full work available at URL http://www.nntdm.net/papers/nntdm-16/NNTDM-16-4-25-28.pdf

zbMATH Keywords

concentrationgraph coloringrainbow connectionrandom graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• A sharp threshold for rainbow connection of random bipartite graphs
• Rainbow connection of random regular graphs
• On rainbow connection
• Rainbow connection of sparse random graphs
• On the threshold for rainbow connection number \(r\) in random graphs

Cited in

(6)

• Rainbow connection of sparse random graphs
• Rainbow and monochromatic vertex-connection of random graphs
• Concentration of rainbow \(k\)-connectivity of a multiplex random graph
• A sharp threshold for rainbow connection of random bipartite graphs
• Rainbow connection of random regular graphs
• A sharp threshold for rainbow connection in small-world networks

This page was built for publication: Sharp concentration of the rainbow connection of random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3099279)