Dismantling Sparse Random Graphs
From MaRDI portal
Publication:3512603
DOI10.1017/S0963548307008802zbMath1156.05055arXiv0709.1787MaRDI QIDQ3512603
Svante Janson, Andrew G. Thomason
Publication date: 21 July 2008
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0709.1787
Related Items
Cites Work
- On the independence number of random graphs
- On the independence and chromatic numbers of random regular graphs
- Fragmentability of graphs
- Concentration of measure and isoperimetric inequalities in product spaces
- Concentration for Independent Permutations
- Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method
- A simple solution to the k‐core problem
- A Separator Theorem for Planar Graphs
- New upper bounds on harmonious colorings
- Decycling numbers of random regular graphs
- The phase transition in inhomogeneous random graphs