The number of graphs without forbidden subgraphs

DOI10.1016/J.JCTB.2003.08.001zbMath1044.05044OpenAlexW2079092774WikidataQ105583650 ScholiaQ105583650MaRDI QIDQ1826950

Béla Bollobás, József Balogh, Miklós Simmonovits

Publication date: 6 August 2004

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2003.08.001

zbMATH Keywords

extremal graphsSzemerédi's regularity lemmaspeed function

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Related Items (33)

On the complexity of finite subgraphs of the curve graph ⋮ The number of \(C_{2\ell}\)-free graphs ⋮ Counting H-free orientations of graphs ⋮ Perfect Graphs of Fixed Density: Counting and Homogeneous Sets ⋮ An intersection theorem for four sets ⋮ Hereditary properties of partitions, ordered graphs and ordered hypergraphs ⋮ Almost all string graphs are intersection graphs of plane convex sets ⋮ Hypergraphs with many Kneser colorings ⋮ The fine structure of octahedron-free graphs ⋮ The structure of almost all graphs in a hereditary property ⋮ Shadows of ordered graphs ⋮ Almost all triple systems with independent neighborhoods are semi-bipartite ⋮ Structure and enumeration theorems for hereditary properties in finite relational languages ⋮ Almost all triangle-free triple systems are tripartite ⋮ An extension of Turán's theorem, uniqueness and stability ⋮ The number of \(K_{m,m}\)-free graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ On Colourings of Hypergraphs Without Monochromatic Fano Planes ⋮ On the structure of oriented graphs and digraphs with forbidden tournaments or cycles ⋮ The typical structure of graphs with no large cliques ⋮ Set systems without a simplex or a cluster ⋮ Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs ⋮ The typical structure of sparse $K_{r+1}$-free graphs ⋮ The Typical Structure of Gallai Colorings and Their Extremal Graphs ⋮ Excluding induced subgraphs: Critical graphs ⋮ DISCRETE METRIC SPACES: STRUCTURE, ENUMERATION, AND 0-1 LAWS ⋮ On the typical structure of graphs in a monotone property ⋮ The typical structure of graphs without given excluded subgraphs ⋮ Estimating parameters associated with monotone properties ⋮ Independent sets in hypergraphs ⋮ Structure and stability of triangle-free set systems ⋮ Almost all string graphs are intersection graphs of plane convex sets ⋮ Exact stability for Turán’s Theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Excluding induced subgraphs. II: Extremal graphs
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• On universality of graphs with uniformly distributed edges
• On the number of graphs without 4-cycles
• The asymptotic number of graphs not containing a fixed color-critical subgraph
• On the size of hereditary classes of graphs
• The speed of hereditary properties of graphs
• On extremal problems of graphs and generalized graphs
• K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law
• Excluding Induced Subgraphs III: A General Asymptotic
• Extremal Graphs without Large Forbidden Subgraphs
• Extremal Graph Problems for Graphs with a Color-Critical Vertex
• Projections of Bodies and Hereditary Properties of Hypergraphs
• On a problem of K. Zarankiewicz
• On the theory of graphs
• The penultimate rate of growth for graph properties
• Measures on monotone properties of graphs

This page was built for publication: The number of graphs without forbidden subgraphs