A sharp threshold for rainbow connection of random bipartite graphs

zbMATH Open1284.05246MaRDI QIDQ3171412FDOQ3171412

Authors: Yilun Shang 

Publication date: 5 October 2011

Recommendations

• Rainbow \(k\)-connectivity of random bipartite graphs
• Sharp concentration of the rainbow connection of random graphs
• On the threshold for rainbow connection number \(r\) in random graphs
• Rainbow connectivity of sparse random graphs
• On rainbow connection

zbMATH Keywords

random graphbipartite graphedge coloringrainbow connection

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Connectivity (05C40)

Cited In (7)

• A sharp threshold for rainbow connection in small-world networks
• On the threshold for rainbow connection number \(r\) in random graphs
• Rainbow \(k\)-connectivity of random bipartite graphs
• Rainbow connectivity and rainbow index of inhomogeneous random graphs
• Rainbow colouring of split graphs
• Concentration of rainbow \(k\)-connectivity of a multiplex random graph
• Sharp concentration of the rainbow connection of random graphs

This page was built for publication: A sharp threshold for rainbow connection of random bipartite graphs

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