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 条
  • [1] Dismantling sparse random graphs
    Janson, Svante
    Thomason, Andrew
    COMBINATORICS PROBABILITY & COMPUTING, 2008, 17 (02): : 259 - 264
  • [2] The diameter of sparse random graphs
    Chung, F
    Lu, LY
    ADVANCES IN APPLIED MATHEMATICS, 2001, 26 (04) : 257 - 279
  • [3] Bisecting sparse random graphs
    Luczak, MJ
    McDiarmid, C
    RANDOM STRUCTURES & ALGORITHMS, 2001, 18 (01) : 31 - 38
  • [4] Sparse Random Graphs with Clustering
    Bollobas, Bela
    Janson, Svante
    Riordan, Oliver
    RANDOM STRUCTURES & ALGORITHMS, 2011, 38 (03) : 269 - 323
  • [5] The diameter of sparse random graphs
    Fernholz, Daniel
    Ramachandran, Vijaya
    RANDOM STRUCTURES & ALGORITHMS, 2007, 31 (04) : 482 - 516
  • [6] TREES IN SPARSE RANDOM GRAPHS
    DELAVEGA, WF
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1988, 45 (01) : 77 - 85
  • [7] Cycles in sparse random graphs
    Marinari, Enzo
    Van Kerrebroeck, Valery
    INTERNATIONAL WORKSHOP ON STATISTICAL-MECHANICAL INFORMATICS 2007 (IW-SMI 2007), 2008, 95
  • [8] The Diameter of Sparse Random Graphs
    Riordan, Oliver
    Wormald, Nicholas
    COMBINATORICS PROBABILITY & COMPUTING, 2010, 19 (5-6): : 835 - 926
  • [9] On the Rigidity of Sparse Random Graphs
    Linial, Nati
    Mosheiff, Jonathan
    JOURNAL OF GRAPH THEORY, 2017, 85 (02) : 466 - 480
  • [10] RANDOM SUBGRAPHS IN SPARSE GRAPHS
    Joos, Felix
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2015, 29 (04) : 2350 - 2360
12345