On the typical structure of graphs in a monotone property

zbMath1298.05273arXiv1404.2456MaRDI QIDQ740672

Andrew J. Uzzell, Svante Janson

Publication date: 9 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.2456

zbMATH Keywords

graph limitsstructure of graphsmonotone properties

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items

Graph limits and hereditary properties

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The structure of almost all graphs in a hereditary property
• Limits of dense graph sequences
• Graph limits and hereditary properties
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• The asymptotic number of graphs not containing a fixed color-critical subgraph
• The number of graphs without forbidden subgraphs
• On String Graph Limits and the Structure of a Typical String Graph
• Graph limits and exchangeable random graphs
• The typical structure of graphs without given excluded subgraphs
• Graph properties, graph limits, and entropy