DIAMETERS OF RANDOM BIPARTITE GRAPHS

被引:7
|
作者
BOLLOBAS, B
KLEE, V
机构
[1] UNIV CAMBRIDGE TRINITY COLL,DEPT MATH,CAMBRIDGE CB2 1TQ,ENGLAND
[2] UNIV WASHINGTON,DEPT MATH,SEATTLE,WA 98195
关键词
D O I
10.1007/BF02579152
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
引用
收藏
页码:7 / 19
页数:13
相关论文
共 50 条
  • [21] The choice number of random bipartite graphs
    Noga Alon
    Michael Krivelevich
    Annals of Combinatorics, 1998, 2 (4) : 291 - 297
  • [22] Realization of subgraphs of random graphs by graphs of diameters in Euclidean spaces
    A. A. Kokotkin
    Doklady Mathematics, 2014, 89 : 362 - 364
  • [23] Realization of subgraphs of random graphs by graphs of diameters in Euclidean spaces
    Kokotkin, A. A.
    DOKLADY MATHEMATICS, 2014, 89 (03) : 362 - 364
  • [24] Random Dense Bipartite Graphs and Directed Graphs With Specified Degrees
    Greenhill, Catherine
    McKay, Brendan D.
    RANDOM STRUCTURES & ALGORITHMS, 2009, 35 (02) : 222 - 249
  • [25] Decompositions of complete bipartite and tripartite graphs into selfcomplementary factors with finite diameters
    Froncek, D
    GRAPHS AND COMBINATORICS, 1996, 12 (04) : 305 - 320
  • [26] Random Generation and Enumeration of Bipartite Permutation Graphs
    Saitoh, Toshiki
    Otachi, Yota
    Yamanaka, Katsuhisa
    Uehara, Ryuhei
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5878 : 1104 - +
  • [27] Spectral and localization properties of random bipartite graphs
    Martínez-Martínez C.T.
    Méndez-Bermúdez J.A.
    Moreno Y.
    Pineda-Pineda J.J.
    Sigarreta J.M.
    Chaos, Solitons and Fractals: X, 2019, 3
  • [28] Periodic Partial Words and Random Bipartite Graphs
    Idiatulina, Lidia A.
    Shur, Arseny M.
    FUNDAMENTA INFORMATICAE, 2014, 132 (01) : 15 - 31
  • [29] PLANARITY AND GENUS OF SPARSE RANDOM BIPARTITE GRAPHS
    Do T.A.
    Erde J.
    Kang M.
    SIAM Journal on Discrete Mathematics, 2022, 36 (02) : 1394 - 1415
  • [30] Bipartite Ramsey Numbers of Cycles for Random Graphs
    Liu, Meng
    Li, Yusheng
    GRAPHS AND COMBINATORICS, 2021, 37 (06) : 2703 - 2711