On the robustness of random \(k\)-cores

DOI10.1016/j.ejc.2014.03.007zbMath1300.05186arXiv1203.2209OpenAlexW2963040959MaRDI QIDQ740272

Cristiane M. Sato

Publication date: 2 September 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

\(k\)-core of a graphmaximal subgraph

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (5)

\(k\)-regular subgraphs near the \(k\)-core threshold of a random graph ⋮ The Stripping Process Can be Slow: Part II ⋮ Core forging and local limit theorems for the \(k\)-core of random graphs ⋮ Loose cores and cycles in random hypergraphs ⋮ Law of large numbers for the SIR epidemic on a random graph with given degrees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Encores on cores
• Asymptotic normality of the \(k\)-core in random graphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Size and connectivity of the \(k\)-core of a random graph
• Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
• Critical subgraphs of a random graph
• Asymptotic enumeration of sparse graphs with a minimum degree constraint
• Sudden emergence of a giant \(k\)-core in a random graph
• Almost all graphs with 1.44n edges are 3-colorable
• A simple solution to the k‐core problem
• Cores in random hypergraphs and Boolean formulas
• Thek-Core and Branching Processes
• Poisson Cloning Model for Random Graphs

This page was built for publication: On the robustness of random \(k\)-cores