Encores on cores

zbMath1112.05094MaRDI QIDQ869995

Nicholas C. Wormald, Julie Cain

Publication date: 12 March 2007

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/127343

zbMATH Keywords

random graphdegree sequencePoisson variables

Mathematics Subject Classification ID

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

Related Items (18)

How does the core sit inside the mantle? ⋮ Sandwiching a densest subgraph by consecutive cores ⋮ Bootstrap percolation in living neural networks ⋮ Singularity of the \(k\)-core of a random graph ⋮ Bootstrap percolation and the geometry of complex networks ⋮ Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph ⋮ On the threshold for \(k\)-regular subgraphs of random graphs ⋮ Orientability Thresholds for Random Hypergraphs ⋮ Cores of random \(r\)-partite hypergraphs ⋮ The cook-book approach to the differential equation method ⋮ Asymptotic normality of the \(k\)-core in random graphs ⋮ \(k\)-regular subgraphs near the \(k\)-core threshold of a random graph ⋮ The Stripping Process Can be Slow: Part II ⋮ On the robustness of random \(k\)-cores ⋮ Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT ⋮ Asymptotic enumeration of strongly connected digraphs by vertices and edges ⋮ Loose cores and cycles in random hypergraphs ⋮ Cores of random graphs are born Hamiltonian

This page was built for publication: Encores on cores