Encores on cores
From MaRDI portal
Publication:869995
zbMATH Open1112.05094MaRDI QIDQ869995FDOQ869995
Authors: Julie Cain, Nicholas Wormald 
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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Cited In (22)
- Singularity of the \(k\)-core of a random graph
- \(k\)-regular subgraphs near the \(k\)-core threshold of a random graph
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- On the threshold for \(k\)-regular subgraphs of random graphs
- The stripping process can be slow. I.
- Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph
- Cores of random \(r\)-partite hypergraphs
- Bootstrap percolation and the geometry of complex networks
- On the robustness of random \(k\)-cores
- Asymptotic normality of the \(k\)-core in random graphs
- Asymptotic enumeration of strongly connected digraphs by vertices and edges
- Cores of random graphs are born Hamiltonian
- Cores in random hypergraphs and Boolean formulas
- The cook-book approach to the differential equation method
- Bootstrap percolation in living neural networks
- Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT
- Sandwiching a densest subgraph by consecutive cores
- Orientability Thresholds for Random Hypergraphs
- Core forging and local limit theorems for the \(k\)-core of random graphs
- Analysis of Algorithms on the Cores of Random Graphs
- The stripping process can be slow. II
- Loose cores and cycles in random hypergraphs
This page was built for publication: Encores on cores
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q869995)
