The typical structure of graphs without given excluded subgraphs

DOI10.1002/RSA.20242zbMATH Open1227.05216OpenAlexW4236586398MaRDI QIDQ3633015FDOQ3633015

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

Publication date 16 June 2009

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/rsa.20242

zbMATH Keywords

extremal graphsgraph countingstructure of \(H\)-free graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Recommendations

• The typical structure of graphs with no large cliques
• scientific article; zbMATH DE number 475587
• The number of graphs without forbidden subgraphs
• The typical structure of sparse \(K_{r+1}\)-free graphs
• The fine structure of octahedron-free graphs

Cites Work

• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• The number of graphs without forbidden subgraphs

Cited In (28)

• Discrete metric spaces: structure, enumeration, and 0-1 laws
• Hypergraphs with many Kneser colorings
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Asymptotic probabilities of extension properties and random \(l\)-colourable structures
• Independent sets in hypergraphs
• The structure of almost all graphs in a hereditary property
• An efficient container lemma
• The structure of typical eye-free graphs and a Turán-type result for two weighted colours
• The number of \(C_{2\ell}\)-free graphs
• Graphs without theta subgraphs
• The fine structure of octahedron-free graphs
• The number of \(K_{m,m}\)-free graphs
• On colourings of hypergraphs without monochromatic Fano planes
• Exact results on the number of restricted edge colorings for some families of linear hypergraphs
• Almost all triangle-free triple systems are tripartite
• On the typical structure of graphs in a monotone property
• The typical structure of sparse \(K_{r+1}\)-free graphs
• On the typical structure of graphs not containing a fixed vertex-critical subgraph
• The number of graphs without forbidden subgraphs
• Excluding induced subgraphs: critical graphs
• Title not available (Why is no real title available?)
• Almost all string graphs are intersection graphs of plane convex sets
• The typical structure of maximal triangle-free graphs
• Almost all triple systems with independent neighborhoods are semi-bipartite
• A limit law of almost \(l\)-partite graphs
• On the structure of oriented graphs and digraphs with forbidden tournaments or cycles
• Almost all string graphs are intersection graphs of plane convex sets
• The typical structure of graphs with no large cliques

This page was built for publication: The typical structure of graphs without given excluded subgraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3633015)