Size and connectivity of the \(k\)-core of a random graph

DOI10.1016/0012-365X(91)90162-UzbMath0752.05046DBLPjournals/dm/Luczak91WikidataQ57259025 ScholiaQ57259025MaRDI QIDQ1179277

Tomasz Łuczak

Publication date: 26 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

connectivityrandom graph

Mathematics Subject Classification ID

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

Related Items (23)

Phase transition phenomena in random discrete structures ⋮ On resilience of connectivity in the evolution of random graphs ⋮ A central limit theorem for diffusion in sparse random graphs ⋮ Collapsibility and vanishing of top homology in random simplicial complexes ⋮ Phase transition of degeneracy in minor-closed families ⋮ Hamiltonian Cycles and Subsets of Discounted Occupational Measures ⋮ Phase transitions in graphs on orientable surfaces ⋮ The cook-book approach to the differential equation method ⋮ Asymptotic normality of the \(k\)-core in random graphs ⋮ On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph ⋮ Birth of a giant \((k_{1},k_{2})\)-core in the random digraph ⋮ Conflict-Free Colouring of Graphs ⋮ Unnamed Item ⋮ The Stripping Process Can be Slow: Part II ⋮ Degree sequences of monocore graphs ⋮ Almost all graphs with average degree 4 are 3-colorable ⋮ On the robustness of random \(k\)-cores ⋮ Core forging and local limit theorems for the \(k\)-core of random graphs ⋮ Density decompositions of networks ⋮ On the Spread of Random Graphs ⋮ Loose cores and cycles in random hypergraphs ⋮ Hamiltonicity in random graphs is born resilient ⋮ Cores of random graphs are born Hamiltonian

Cites Work

• The chromatic number of random graphs at the double-jump threshold
• Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at leastk
• Probability Inequalities for Sums of Bounded Random Variables
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Size and connectivity of the \(k\)-core of a random graph