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 条
  • [41] Fast Generation of Sparse Random Kernel Graphs
    Hagberg, Aric
    Lemons, Nathan
    PLOS ONE, 2015, 10 (09):
  • [42] Index statistical properties of sparse random graphs
    Metz, F. L.
    Stariolo, Daniel A.
    PHYSICAL REVIEW E, 2015, 92 (04):
  • [43] ON THE GAME CHROMATIC NUMBER OF SPARSE RANDOM GRAPHS
    Frieze, Alan
    Haber, Simcha
    Lavrov, Mikhail
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2013, 27 (02) : 768 - 790
  • [44] Packing and finding paths in sparse random graphs
    Iršič, Vesna
    Portier, Julien
    Versteegen, Leo
    arXiv,
  • [45] First order distinguishability of sparse random graphs
    Hershko, Tal
    Zhukovskii, Maksim
    PROCEEDINGS OF THE 39TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, LICS 2024, 2024,
  • [46] LARGE INDUCED TREES IN SPARSE RANDOM GRAPHS
    FRIEZE, AM
    JACKSON, B
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1987, 42 (02) : 181 - 195
  • [47] MAXIMAL INDUCED TREES IN SPARSE RANDOM GRAPHS
    LUCZAK, T
    PALKA, Z
    DISCRETE MATHEMATICS, 1988, 72 (1-3) : 257 - 265
  • [48] ORDERS OF INDUCED SUBGRAPHS IN SPARSE RANDOM GRAPHS
    PALKA, Z
    ANNALS OF THE NEW YORK ACADEMY OF SCIENCES, 1989, 576 : 431 - 440
  • [49] Assortativity and clustering of sparse random intersection graphs
    Bloznelis, Mindaugas
    Jaworski, Jerzy
    Kurauskas, Valentas
    ELECTRONIC JOURNAL OF PROBABILITY, 2013, 18 : 1 - 24
  • [50] Twin-width of sparse random graphs
    Hendrey, Kevin
    Norin, Sergey
    Steiner, Raphael
    Turcotte, Jeremie
    COMBINATORICS PROBABILITY AND COMPUTING, 2024,
12345