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 条
  • [1] Counting H-free orientations of graphs
    Bucic, Matija
    Janzer, Oliver
    Sudakov, Benny
    [J]. MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 2023, 174 (01) : 79 - 95
  • [2] On Switching to H-Free Graphs
    Jelinkova, Eva
    Kratochvil, Jan
    [J]. GRAPH TRANSFORMATIONS, ICGT 2008, 2008, 5214 : 379 - 395
  • [3] On Switching to H-Free Graphs
    Jelinkova, Eva
    Kratochvil, Jan
    [J]. JOURNAL OF GRAPH THEORY, 2014, 75 (04) : 387 - 405
  • [4] Choosability on H-free graphs
    Golovach, Petr A.
    Heggernes, Pinar
    van't Hof, Pim
    Paulusma, Daniel
    [J]. INFORMATION PROCESSING LETTERS, 2013, 113 (04) : 107 - 110
  • [5] MaxCut in H-free graphs
    Alon, N
    Krivelevich, M
    Sudakov, B
    [J]. COMBINATORICS PROBABILITY & COMPUTING, 2005, 14 (5-6): : 629 - 647
  • [6] Extremal H-free planar graphs
    Lan, Yongxin
    Shi, Yongtang
    Song, Zi-Xia
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2019, 26 (02):
  • [7] On Subgraph Complementation to H-free Graphs
    Dhanyamol Antony
    Jay Garchar
    Sagartanu Pal
    R. B. Sandeep
    Sagnik Sen
    R. Subashini
    [J]. Algorithmica, 2022, 84 : 2842 - 2870
  • [8] BIPARTITE SUBGRAPHS OF H-FREE GRAPHS
    Zeng, Qinghou
    Hou, Jianfeng
    [J]. BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 2017, 96 (01) : 1 - 13
  • [9] Orthonormal Representations of H-Free Graphs
    Igor Balla
    Shoham Letzter
    Benny Sudakov
    [J]. Discrete & Computational Geometry, 2020, 64 : 654 - 670
  • [10] On Subgraph Complementation to H-free Graphs
    Antony, Dhanyamol
    Garchar, Jay
    Pal, Sagartanu
    Sandeep, R. B.
    Sen, Sagnik
    Subashini, R.
    [J]. ALGORITHMICA, 2022, 84 (10) : 2842 - 2870
12345