THE MAXIMAL NUMBER OF EDGES IN A HOMOGENEOUS HYPERGRAPH CONTAINING NO PROHIBITED SUBGRAPHS

被引:29
|
作者
SIDORENKO, AF
机构
关键词
D O I
10.1007/BF01158259
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
引用
收藏
页码:247 / 259
页数:13
相关论文
共 50 条
  • [21] The Number of Edges in Induced Subgraphs of Some Distance Graphs
    Pushnyakov, F. A.
    MATHEMATICAL NOTES, 2019, 105 (3-4) : 582 - 591
  • [22] On the Number of Edges of a Uniform Hypergraph with a Range of Allowed Intersections
    Bobu, A. V.
    Kupriyanov, A. E.
    Raigorodskii, A. M.
    PROBLEMS OF INFORMATION TRANSMISSION, 2017, 53 (04) : 319 - 342
  • [23] On the maximum number of edges in a hypergraph with a unique perfect matching
    Bal, Deepak
    Dudek, Andrzej
    Yilma, Zelealem B.
    DISCRETE MATHEMATICS, 2011, 311 (21) : 2577 - 2580
  • [24] On the Number of Edges in a 3-Uniform Hypergraph with No (k
    Wang, Qinglin
    Tian, Yingzhi
    Feng, Lihua
    JOURNAL OF INTERCONNECTION NETWORKS, 2022, 22 (01)
  • [25] On the Number of Edges of a Uniform Hypergraph with a Range of Allowed Intersections
    A. V. Bobu
    A. E. Kupriyanov
    A. M. Raigorodskii
    Problems of Information Transmission, 2017, 53 : 319 - 342
  • [26] On the number of edges in a uniform hypergraph with a range of permitted intersections
    Bobu, A. V.
    Kupriyanov, A. E.
    Raigorodskii, A. M.
    DOKLADY MATHEMATICS, 2017, 96 (01) : 354 - 357
  • [27] THE MAXIMAL NUMBER OF INDUCED R-PARTITE SUBGRAPHS
    BOLLOBAS, B
    EGAWA, Y
    HARRIS, A
    JIN, GP
    GRAPHS AND COMBINATORICS, 1995, 11 (01) : 1 - 19
  • [28] On the Minimal Number of Edges in Induced Subgraphs of Special Distance Graphs
    Shubin, Ya K.
    MATHEMATICAL NOTES, 2022, 111 (5-6) : 961 - 969
  • [29] Lower Bound on the Minimum Number of Edges in Subgraphs of Johnson Graphs
    Shubin, Ya. K.
    PROBLEMS OF INFORMATION TRANSMISSION, 2022, 58 (04) : 382 - 388
  • [30] On the number of edges in a graph with no (k+1)-connected subgraphs
    Bernshteyn, Anton
    Kostochka, Alexandr
    DISCRETE MATHEMATICS, 2016, 339 (02) : 682 - 688