Concentration of rainbow k-connectivity of a multiplex random graph

DOI10.1016/J.TCS.2023.113771OpenAlexW4319878690MaRDI QIDQ2689447FDOQ2689447

Authors: Yilun Shang 

Publication date: 10 March 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.113771

Recommendations

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

zbMATH Keywords

random graphmultiplex networkrainbow connectivityrainbow path

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Cites Work

• On rainbow connection
• Rainbow connection number and connected dominating sets
• The rainbow connectivity of a graph
• Rainbow connection in graphs
• Radius, diameter, and minimum degree
• The probabilistic method
• On the concentration of the domination number of the random graph
• On the domination number of a random graph
• Rainbow connection of random regular graphs
• Probability and Computing
• On the strength of connectedness of a random graph
• The concentration of the chromatic number of random graphs
• Title not available (Why is that?)
• Introduction to Random Graphs
• A sharp threshold for rainbow connection of random bipartite graphs
• On rainbow-\(k\)-connectivity of random graphs
• On the chromatic number of random graphs
• The diameter of sparse random graphs
• The diameter of sparse random graphs
• Multilayer networks. Structure and function
• Rainbow connection of sparse random graphs
• Sharp concentration of the equitable chromatic number of dense random graphs
• Rainbow \(k\)-connectivity of random bipartite graphs
• On a rainbow version of Dirac's theorem
• A rainbow version of Mantel's theorem
• On the rainbow matching conjecture for 3-uniform hypergraphs
• From one to many rainbow Hamiltonian cycles
• A sharp threshold for rainbow connection in small-world networks
• Transversal factors and spanning trees
• Rainbow spanning structures in graph and hypergraph systems

Cited In (3)

• Two-distance vertex-distinguishing index of sparse graphs
• Optimal secret share distribution in degree splitting communication networks
• Rainbow connectivity and rainbow index of inhomogeneous random graphs

This page was built for publication: Concentration of rainbow \(k\)-connectivity of a multiplex random graph

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