The number of graphs without forbidden subgraphs
Authors:
- 1 May 2004
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 91 (1) , 1-24
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Measures on monotone properties of graphsDiscrete Applied Mathematics, 2002
- The Penultimate Rate of Growth for Graph PropertiesEuropean Journal of Combinatorics, 2001
- The Speed of Hereditary Properties of GraphsJournal of Combinatorial Theory, Series B, 2000
- Projections of Bodies and Hereditary Properties of HypergraphsBulletin of the London Mathematical Society, 1995
- Extremal Graph Problems for Graphs with a Color-Critical VertexCombinatorics, Probability and Computing, 1993
- Excluding Induced Subgraphs III: A General AsymptoticRandom Structures & Algorithms, 1992
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponentGraphs and Combinatorics, 1986
- On the number of graphs without 4-cyclesDiscrete Mathematics, 1982
- On extremal problems of graphs and generalized graphsIsrael Journal of Mathematics, 1964
- On a problem of K. ZarankiewiczColloquium Mathematicum, 1954