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 条
  • [31] Maximum bipartite subgraphs in H-free graphs
    Jing Lin
    Czechoslovak Mathematical Journal, 2022, 72 : 621 - 635
  • [32] Chromatic symmetric functions and H-free graphs
    Hamel, Angele M.
    Hoang, Chinh T.
    Tuero, Jake E.
    GRAPHS AND COMBINATORICS, 2019, 35 (04) : 815 - 825
  • [33] Partitioning H-free graphs of bounded diameter
    Brause, Christoph
    Golovach, Petr
    Martin, Barnaby
    Paulusma, Daniel
    Smith, Siani
    THEORETICAL COMPUTER SCIENCE, 2022, 930 : 37 - 52
  • [34] Open Packing in H-free Graphs and Subclasses of Split Graphs
    Shalu, M. A.
    Kirubakaran, V. K.
    ALGORITHMS AND DISCRETE APPLIED MATHEMATICS, CALDAM 2024, 2024, 14508 : 239 - 251
  • [35] Dense H-free graphs are almost (χ(H)-1)-partite
    Allen, Peter
    ELECTRONIC JOURNAL OF COMBINATORICS, 2010, 17 (01):
  • [36] Many cliques in H-free subgraphs of random graphs
    Alon, Noga
    Kostochka, Alexandr
    Shikhelman, Clara
    JOURNAL OF COMBINATORICS, 2018, 9 (04) : 567 - 597
  • [37] Disjoint paths and connected subgraphs for H-free graphs
    Kern, Walter
    Martin, Barnaby
    Paulusma, Daniël
    Smith, Siani
    van Leeuwen, Erik Jan
    Theoretical Computer Science, 2022, 898 : 59 - 68
  • [38] Parameterized Complexity of Independent Set in H-Free Graphs
    Bonnet, Edouard
    Bousquet, Nicolas
    Charbit, Pierre
    Thomasse, Stephan
    Watrigant, Remi
    ALGORITHMICA, 2020, 82 (08) : 2360 - 2394
  • [39] Few Induced Disjoint Paths for H-Free Graphs
    Martin, Barnaby
    Paulusma, Daniel
    Smith, Siani
    van Leeuwen, Erik Jan
    COMBINATORIAL OPTIMIZATION (ISCO 2022), 2022, 13526 : 89 - 101
  • [40] On the complexity of matching cut for graphs of bounded radius and H-free graphs
    Lucke, Felicia
    Paulusma, Daniel
    Ries, Bernard
    THEORETICAL COMPUTER SCIENCE, 2022, 936 : 33 - 42
12345