Core forging and local limit theorems for the k-core of random graphs
Authors:
- Amin Coja-OghlanACAmin Coja-Oghlan
- Oliver CooleyOCOliver Cooley
- Mihyun KangMKMihyun Kang
- Kathrin SkubchKSKathrin Skubch
- 1 July 2019
- journal article
- research article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 137, 178-231
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Austrian Science Fund (P26826, W1230)
- Seventh Framework Programme (FP/2007-2013)
- European Research Council (278857)
This publication has 17 references indexed in Scilit:
- Finite size scaling for the core of large random hypergraphsThe Annals of Applied Probability, 2008
- Asymptotic normality of the k-core in random graphsThe Annals of Applied Probability, 2008
- A simple solution to the k‐core problemRandom Structures & Algorithms, 2006
- Cores in random hypergraphs and Boolean formulasRandom Structures & Algorithms, 2005
- The cores of random hypergraphs with a given degree sequenceRandom Structures & Algorithms, 2004
- Efficient erasure correcting codesIEEE Transactions on Information Theory, 2001
- Sudden Emergence of a Giantk-Core in a Random GraphJournal of Combinatorial Theory, Series B, 1996
- A new bijection on rooted forestsDiscrete Mathematics, 1993
- Size and connectivity of the k-core of a random graphDiscrete Mathematics, 1991
- On stirling numbers of the second kindJournal of Combinatorial Theory, 1969