Abstract
A path in an edge-colored graph G is called a rainbow path if no two edges of the path are colored the same color. The minimum number of colors required to color the edges of G such that every pair of vertices are connected by at least k internally vertex-disjoint rainbow paths is called the rainbow k-connectivity of the graph G, denoted by rck(G). For the random graph G(n,p), He and Liang got a sharp threshold function for the property rck(G(n,p)) ≤ d. For the random equi-bipartite graph G(n,n,p), Fujita et. al. got a sharp threshold function for the property rck(G(n,n,p)) ≤ 3. They also posed the following problem: For d ≥ 2, determine a sharp threshold function for the property rck(G) ≤ d, where G is another random graph model. This paper is to give a solution to their problem in the general random bipartite graph model G(m,n,p).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bollobás, B. The diameter of random graphs. Trans. Amer. Math. Soc., 267: 41–52 (1981)
Bollobás, B. Random Graphs. Academic Press, 1985
Bollobás, B., Thomason, A. Threshold function. Combinatorica, 7: 35–38 (1986)
Bondy, J., Murty, U. Graph Theory. Springer, 2008
Caro, Y., Lev, A., Roditty, Y., Tuza, Z., Yuster, R. On rainbow connection. Electron. J. Combin., 15: R57 (2008)
Chakraborty, S., Fischer, E., Matsliah, A., Yuster, R. Hardness and algorithms for rainbow connectivity. J. Combin. Optim., 21: 330–347 (2011)
Chartrand, G., Johns, G., Mckeon, K., Zhang, P. Rainbow connection in graphs. Math. Bohem., 133: 85–98 (2008)
Chartrand, G., Johns, G., Mckeon, K., Zhang, P. The rainbow connectivity of a graph. Networks, 54: 75–81 (2009)
Dudek, A., Frieze, A., Tsourakakis, C. Rainbow connection of random regular graphs. SIAM Journal on Discrete Mathematics, 29: 2255–2266 (2015)
Ericksen, A. A matter of security. Graduating Engineer & Computer Careers, 24–28 (2007)
Friedgut, E., Kalai, G. Every monotone graph property has a sharp threshold. Proc. Amer. Math. Soc., 124: 2993–3002 (1996)
Fujita, S., Liu, H., Magnant, C. Rainbow k-connection in dense graphs. Electron. Notes Discrete Math., 38: 361–366 (2011)
He, J., Liang, H. On rainbow k-connectivity of random graphs. Inform. Process. Lett., 112: 406–410 (2012)
Kamčev, N., Krivelevich, M., Sudakov, B. Some remarks on rainbow connectivity. Journal of Graph Theory, 83: 372–383 (2016)
Li, X., Shi, Y., Sun, Y. Rainbow connections of graphs: a survey. Graphs & Combin., 29: 1–38 (2013)
Li, X., Sun, Y. Rainbow Connections of Graphs. SpringerBriefs in Math., Springer, 2012
Author information
Authors and Affiliations
Corresponding author
Additional information
This paper is supported by the National Natural Science Foundation of China (Nos. 11871034, 11531011) and by the Natural Science Foundation of Jiangsu Province (No. BK20150169).
Rights and permissions
About this article
Cite this article
Chen, Xl., Li, Xl. & Lian, Hs. Rainbow k-connectivity of Random Bipartite Graphs. Acta Math. Appl. Sin. Engl. Ser. 36, 879–890 (2020). https://doi.org/10.1007/s10255-020-0970-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10255-020-0970-z