The typical structure of graphs without given excluded subgraphs
From MaRDI portal
Publication:3633015
DOI10.1002/rsa.20242zbMath1227.05216MaRDI QIDQ3633015
József Balogh, Béla Bollobás, Miklós Simmonovits
Publication date: 16 June 2009
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20242
05C35: Extremal problems in graph theory
05C80: Random graphs (graph-theoretic aspects)
05C75: Structural characterization of families of graphs
Related Items
Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs, Almost all string graphs are intersection graphs of plane convex sets, DISCRETE METRIC SPACES: STRUCTURE, ENUMERATION, AND 0-1 LAWS, An efficient container lemma, Independent sets in hypergraphs, 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, Hypergraphs with many Kneser colorings, Almost all triangle-free triple systems are tripartite, The fine structure of octahedron-free graphs, The structure of almost all graphs in a hereditary property, The number of \(K_{m,m}\)-free graphs, The typical structure of graphs with no large cliques, On the typical structure of graphs in a monotone property, Asymptotic probabilities of extension properties and random \(l\)-colourable structures, On the structure of oriented graphs and digraphs with forbidden tournaments or cycles, Almost all string graphs are intersection graphs of plane convex sets, Almost all triple systems with independent neighborhoods are semi-bipartite, The typical structure of sparse $K_{r+1}$-free graphs, A Limit Law of Almost l-partite Graphs, Excluding induced subgraphs: Critical graphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, THE TYPICAL STRUCTURE OF MAXIMAL TRIANGLE-FREE GRAPHS, On Colourings of Hypergraphs Without Monochromatic Fano Planes
Cites Work
