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 条
  • [41] Disjoint Paths and Connected Subgraphs for H-Free Graphs
    Kern, Walter
    Martin, Barnaby
    Paulusma, Daniel
    Smith, Siani
    van Leeuwen, Erik Jan
    COMBINATORIAL ALGORITHMS, IWOCA 2021, 2021, 12757 : 414 - 427
  • [42] Parameterized Inapproximability of Independent Set in H-Free Graphs
    Pavel Dvořák
    Andreas Emil Feldmann
    Ashutosh Rai
    Paweł Rzążewski
    Algorithmica, 2023, 85 : 902 - 928
  • [43] Computing Subset Vertex Covers in H-Free Graphs
    Brettell, Nick
    Oostveen, Jelle J.
    Pandey, Sukanya
    Paulusma, Daniel
    van Leeuwen, Erik Jan
    FUNDAMENTALS OF COMPUTATION THEORY, FCT 2023, 2023, 14292 : 88 - 102
  • [44] Few induced disjoint paths for H-free graphs
    Martin, Barnaby
    Paulusma, Daniel
    Smith, Siani
    Leeuwen, Erik Jan van
    THEORETICAL COMPUTER SCIENCE, 2023, 939 : 182 - 193
  • [45] Disjoint paths and connected subgraphs for H-free graphs
    Kern, Walter
    Martin, Barnaby
    Paulusma, Daniel
    Smith, Siani
    van Leeuwen, Erik Jan
    THEORETICAL COMPUTER SCIENCE, 2022, 898 : 59 - 68
  • [46] Computing Weighted Subset Transversals in H-Free Graphs
    Brettell, Nick
    Johnson, Matthew
    Paulusma, Daniel
    ALGORITHMS AND DATA STRUCTURES, WADS 2021, 2021, 12808 : 229 - 242
  • [47] Parameterized Inapproximability of Independent Set in H-Free Graphs
    Dvorak, Pavel
    Feldmann, Andreas Emil
    Rai, Ashutosh
    Rzazewski, Pawel
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, WG 2020, 2020, 12301 : 40 - 53
  • [48] Parameterized Complexity of Independent Set in H-Free Graphs
    Édouard Bonnet
    Nicolas Bousquet
    Pierre Charbit
    Stéphan Thomassé
    Rémi Watrigant
    Algorithmica, 2020, 82 : 2360 - 2394
  • [49] For Most Graphs H, Most H-Free Graphs Have a Linear Homogeneous Set
    Kang, Ross J.
    McDiarmid, Colin
    Reed, Bruce
    Scott, Alex
    RANDOM STRUCTURES & ALGORITHMS, 2014, 45 (03) : 343 - 361
  • [50] Parameterized Inapproximability of Independent Set in H-Free Graphs
    Dvorak, Pavel
    Feldmann, Andreas Emil
    Rai, Ashutosh
    Rzazewski, Pawel
    ALGORITHMICA, 2023, 85 (04) : 902 - 928
12345