The structure of hereditary properties and colourings of random graphs
From MaRDI portal
Publication:5928567
DOI10.1007/s004930070019zbMath0959.05105MaRDI QIDQ5928567
Béla Bollobás, Andrew G. Thomason
Publication date: 1 April 2001
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004930070019
05C80: Random graphs (graph-theoretic aspects)
05C75: Structural characterization of families of graphs
05C15: Coloring of graphs and hypergraphs
Related Items
Almost All Friendly Matrices Have Many Obstructions, Simple Containers for Simple Hypergraphs, The Structure of Typical Eye-Free Graphs and a Turán-Type Result for Two Weighted Colours, The penultimate rate of growth for graph properties, On the edit distance function of the random graph, The edit distance function and symmetrization, Supersaturation for hereditary properties, Hypergraph containers, The structure of hereditary properties and 2-coloured multigraphs, The maximum edit distance from hereditary graph properties, Sparse multipartite graphs as partition universal for graphs with bounded degree, Accumulation points of the edit distance function, Largest sparse subgraphs of random graphs, Unnamed Item, Unnamed Item, Perfect Graphs of Fixed Density: Counting and Homogeneous Sets, Counting List Matrix Partitions of Graphs, The t-Improper Chromatic Number of Random Graphs, Stability‐type results for hereditary properties
