Counting H-free graphs

被引：11
|
作者：
Promel, HJ
Steger, A
机构：
[1] HUMBOLDT UNIV BERLIN,INST INFORMAT,D-10099 BERLIN,GERMANY
[2] UNIV DUISBURG GESAMTHSCH,FACHBEREICH MATH,D-47048 DUISBURG,GERMANY
来源：
DISCRETE MATHEMATICS | 1996年 / 154卷 / 1-3期
关键词：
D O I：
10.1016/0012-365X(94)00334-F
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Let Forb(n,m)(H) denote the class of all H-free graphs on n (labelled) vertices with m edges. In this note we estimate the cardinality of \Forb(n,m)(H)\ by establishing good bounds for the probability that a random graph in the G(n,m)-model does not contain a given subgraph.
引用
收藏
页码：311 / 315
页数：5
相关论文
共 50 条
  • [21] New results for MaxCut in H-free graphs
    Glock, Stefan
    Janzer, Oliver
    Sudakov, Benny
    JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 2023, : 441 - 481
  • [22] MAXIMUM BIPARTITE SUBGRAPHS IN H-FREE GRAPHS
    Lin, Jing
    CZECHOSLOVAK MATHEMATICAL JOURNAL, 2022, 72 (03) : 621 - 635
  • [23] Minimum Degree Stability of H-Free Graphs
    Illingworth, Freddie
    COMBINATORICA, 2023, 43 (01) : 129 - 147
  • [24] Max-Bisections of H-free graphs
    Hou, Jianfeng
    Yan, Juan
    DISCRETE MATHEMATICS, 2020, 343 (0I)
  • [25] Partitioning H-free graphs of bounded diameter
    Brause, Christoph
    Golovach, Petr
    Martin, Barnaby
    Paulusma, Daniël
    Smith, Siani
    Theoretical Computer Science, 2022, 930 : 37 - 52
  • [26] Critical vertices and edges in H-free graphs
    Paulusma, Daniel
    Picouleau, Christophe
    Ries, Bernard
    DISCRETE APPLIED MATHEMATICS, 2019, 257 : 361 - 367
  • [27] Computing subset transversals in H-free graphs
    Brettell, Nick
    Johnson, Matthew
    Paesani, Giacomo
    Paulusma, Daniel
    THEORETICAL COMPUTER SCIENCE, 2022, 902 : 76 - 92
  • [28] Contraction and deletion blockers for perfect graphs and H-free graphs
    Diner, Oznur Yasar
    Paulusma, Daniel
    Picouleau, Christophe
    Ries, Bernard
    THEORETICAL COMPUTER SCIENCE, 2018, 746 : 49 - 72
  • [29] Many T copies in H-free graphs
    Alon, Noga
    Shikhelman, Clara
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2016, 121 : 146 - 172
  • [30] Finding Matching Cuts in H-Free Graphs
    Felicia Lucke
    Daniël Paulusma
    Bernard Ries
    Algorithmica, 2023, 85 : 3290 - 3322
12345