ℓ $\ell $‐Connectivity and ℓ $\ell $‐edge‐connectivity of random graphs

DOI10.1002/jgt.22807zbMath1522.05248OpenAlexW4213004198MaRDI QIDQ6081885

Ran Gu, Hua Wang, Yongtang Shi, Xiaofeng Gu

Publication date: 5 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.22807

zbMATH Keywords

random graphhitting timethreshold function\(\ell\)-connectivity\(\ell\)-edge-connectivity

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Connectivity (05C40) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the \(\ell\)-connectivity of a graph
• Bounds on the size of graphs of given order and \(l\)-connectivity
• Tough Ramsey graphs without short cycles
• Toughness and spectrum of a graph
• Characterization of minimally \((2,l)\)-connected graphs
• Mixed connectivity properties of random graphs and some special graphs
• Toughness in pseudo-random graphs
• Toughness in graphs -- a survey
• Tough graphs and Hamiltonian circuits.
• Component connectivity of hypercubes
• Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs
• On the strength of connectedness of a random graph
• The Strength of Connectivity of a Random Graph
• A Generalization of Line Connectivity and Optimally Invulnerable Graphs
• Minimally (k, k)‐edge‐connected graphs
• Paths in graphs
• A Proof of Brouwer's Toughness Conjecture
• Random Graphs
• On the Probability of Connectedness of a Random Graph $\mathcal{G}_m (t)$

This page was built for publication: ℓ $\ell $‐Connectivity and ℓ $\ell $‐edge‐connectivity of random graphs