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