How does the core sit inside the mantle?

DOI10.1016/j.endm.2015.06.068zbMath1346.05044arXiv1503.09030OpenAlexW2600527509MaRDI QIDQ322305

Kathrin Skubch, Mihyun Kang, Oliver Cooley, Amin Coja-Oghlan

Publication date: 14 October 2016

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.09030

zbMATH Keywords

random graphsbranching processlocal weak convergence\(k\)-corewarning propagationk-core

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (3)

Singularity of the \(k\)-core of a random graph ⋮ Phase transitions in graphs on orientable surfaces ⋮ Core forging and local limit theorems for the \(k\)-core of random graphs

Cites Work

• Unnamed Item
• Encores on cores
• Differential equation approximations for Markov chains
• Sudden emergence of a giant \(k\)-core in a random graph
• The transitive closure of a random digraph
• A simple solution to the k‐core problem
• Information, Physics, and Computation
• Cores in random hypergraphs and Boolean formulas
• The freezing threshold for k-colourings of a random graph
• Thek-Core and Branching Processes
• Poisson Cloning Model for Random Graphs

This page was built for publication: How does the core sit inside the mantle?