A RANDOM GRAPH WITH A SUBCRITICAL NUMBER OF EDGES

被引:0
|
作者
PITTEL, B [1 ]
机构
[1] OHIO STATE UNIV, DEPT MATH, COLUMBUS, OH 43210 USA
关键词
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
引用
收藏
页码:51 / 75
页数:25
相关论文
共 50 条
  • [1] On the connected components of a random permutation graph with a given number of edges
    Acan, Huseyin
    Pittel, Boris
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2013, 120 (08) : 1947 - 1975
  • [2] The Size of a Maximum Subgraph of the Random Graph with a Given Number of Edges
    Derevyanko, N. M.
    Zhukovskii, M. E.
    Rassias, M.
    Skorkin, A. Yu.
    DOKLADY MATHEMATICS, 2019, 100 (02) : 478 - 479
  • [3] The Size of a Maximum Subgraph of the Random Graph with a Given Number of Edges
    N. M. Derevyanko
    M. E. Zhukovskii
    M. Rassias
    A. Yu. Skorkin
    Doklady Mathematics, 2019, 100 : 478 - 479
  • [4] ON NUMBER OF DISJOINT EDGES IN A GRAPH
    WEINSTEIN, JM
    CANADIAN JOURNAL OF MATHEMATICS, 1963, 15 (01): : 106 - &
  • [5] Maximum sparse induced subgraphs of the binomial random graph with given number of edges
    Kamaldinov, Dmitry
    Skorkin, Arkadiy
    Zhukovskii, Maksim
    DISCRETE MATHEMATICS, 2021, 344 (02)
  • [6] On the Number of Edges in a Minimum -Saturated Graph
    Zhang, Mingchao
    Luo, Song
    Shigeno, Maiko
    GRAPHS AND COMBINATORICS, 2015, 31 (04) : 1085 - 1106
  • [7] The number of edges in a subgraph of a Hamming graph
    Squier, R
    Torrence, B
    Vogt, A
    APPLIED MATHEMATICS LETTERS, 2001, 14 (06) : 701 - 705
  • [8] ON THE NUMBER OF EDGES IN THE TRANSITIVE CLOSURE OF A GRAPH
    MCCOLL, WF
    NOSHITA, K
    DISCRETE APPLIED MATHEMATICS, 1986, 15 (01) : 67 - 73
  • [9] CLIQUE COVERINGS OF THE EDGES OF A RANDOM GRAPH
    BOLLOBAS, B
    ERDOS, P
    SPENCER, J
    WEST, DB
    COMBINATORICA, 1993, 13 (01) : 1 - 5
  • [10] TURANS THEOREM FOR NUMBER OF EDGES OF A GRAPH
    MARTINOV, N
    DOKLADI NA BOLGARSKATA AKADEMIYA NA NAUKITE, 1977, 30 (04): : 479 - 481