The typical structure of graphs without given excluded subgraphs
From MaRDI portal
Publication:3633015
DOI10.1002/rsa.20242zbMath1227.05216OpenAlexW4236586398MaRDI 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
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Structural characterization of families of graphs (05C75)
Related Items
The number of \(C_{2\ell}\)-free graphs, THE TYPICAL STRUCTURE OF MAXIMAL TRIANGLE-FREE GRAPHS, 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, Almost all triple systems with independent neighborhoods are semi-bipartite, The Structure of Typical Eye-Free Graphs and a Turán-Type Result for Two Weighted Colours, Almost all triangle-free triple systems are tripartite, 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, 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, Excluding induced subgraphs: Critical graphs, DISCRETE METRIC SPACES: STRUCTURE, ENUMERATION, AND 0-1 LAWS, On the typical structure of graphs in a monotone property, An efficient container lemma, Asymptotic probabilities of extension properties and random \(l\)-colourable structures, Independent sets in hypergraphs, A Limit Law of Almost l-partite Graphs, Almost all string graphs are intersection graphs of plane convex sets
Cites Work
