Dismantling sparse random graphs

被引：0
|
作者：
Department of Mathematics, Uppsala University, PO Box 480, SE-75.1 06 Uppsala, Sweden [1 ]
不详 [2 ]
机构：
来源：
Comb. Probab. Comput. | 2008年 / 2卷 / 259-264期
关键词：
Graph theory;
D O I：
10.1017/S0963548307008802
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [31] Chromatic Thresholds in Sparse Random Graphs
    Allen, Peter
    Bottcher, Julia
    Griffiths, Simon
    Kohayakawa, Yoshiharu
    Morris, Robert
    RANDOM STRUCTURES & ALGORITHMS, 2017, 51 (02) : 215 - 236
  • [32] Majority dynamics on sparse random graphs
    Chakraborti, Debsoumya
    Kim, Jeong Han
    Lee, Joonkyung
    Tran, Tuan
    RANDOM STRUCTURES & ALGORITHMS, 2023, 63 (01) : 171 - 191
  • [33] The friendship paradox for sparse random graphs
    Hazra, Rajat Subhra
    den Hollander, Frank
    Parvaneh, Azadeh
    PROBABILITY THEORY AND RELATED FIELDS, 2025,
  • [34] EXTREMAL CUTS OF SPARSE RANDOM GRAPHS
    Dembo, Amir
    Montanari, Andrea
    Sen, Subhabrata
    ANNALS OF PROBABILITY, 2017, 45 (02): : 1190 - 1217
  • [35] A note on the width of sparse random graphs
    Do, Tuan Anh
    Erde, Joshua
    Kang, Mihyun
    JOURNAL OF GRAPH THEORY, 2024, 106 (02) : 273 - 295
  • [36] Sparse quasi-random graphs
    Chung, F
    Graham, R
    COMBINATORICA, 2002, 22 (02) : 217 - 244
  • [37] INDEPENDENT SETS IN RANDOM SPARSE GRAPHS
    GAZMURI, PG
    NETWORKS, 1984, 14 (03) : 367 - 377
  • [38] Independent Sets of Random Trees and Sparse Random Graphs
    Heilman, Steven
    JOURNAL OF GRAPH THEORY, 2025,
  • [39] CUTOFF FOR NONBACKTRACKING RANDOM WALKS ON SPARSE RANDOM GRAPHS
    Ben-Hamou, Anna
    Salez, Justin
    ANNALS OF PROBABILITY, 2017, 45 (03): : 1752 - 1770
  • [40] On-line coloring of sparse random graphs and random trees
    Pittel, B
    Weishaar, RS
    JOURNAL OF ALGORITHMS, 1997, 23 (01) : 195 - 205
12345