Structure and enumeration theorems for hereditary properties in finite relational languages

DOI10.1016/j.apal.2018.01.002zbMath1385.03039arXiv1607.04902OpenAlexW2964350138MaRDI QIDQ1706268

Caroline A. Terry

Publication date: 21 March 2018

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

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

zbMATH Keywords

model theoryasymptotic enumerationextremal combinatorics

Mathematics Subject Classification ID

Asymptotic enumeration (05A16) Model theory of finite structures (03C13) Models of other mathematical theories (03C65) Applications of model theory (03C98) Extremal combinatorics (05D99)

Related Items (5)

Jumps in speeds of hereditary properties in finite relational languages ⋮ Rectilinear approximation and volume estimates for hereditary bodies via [0, 1‐decorated containers] ⋮ On an extremal problem for locally sparse multigraphs ⋮ Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers ⋮ An Extremal Graph Problem with a Transcendental Solution

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Almost all triangle-free triple systems are tripartite
• Hypergraph containers
• Recent trends in combinatorics
• The structure of almost all graphs in a hereditary property
• The typical structure of graphs with no large cliques
• Excluding induced subgraphs. II: Extremal graphs
• Asymptotic probabilities of extension properties and random \(l\)-colourable structures
• Hereditary properties of hypergraphs
• Hereditary properties of tournaments
• Classification theory and the number of non-isomorphic models.
• On the size of hereditary classes of graphs
• Forbidding induced even cycles in a graph: typical structure and counting
• The number of graphs without forbidden subgraphs
• The speed of hereditary properties of graphs
• On the structure of oriented graphs and digraphs with forbidden tournaments or cycles
• Almost all triple systems with independent neighborhoods are semi-bipartite
• The number of oriantations having no fixed tournament
• THE TYPICAL STRUCTURE OF MAXIMAL TRIANGLE-FREE GRAPHS
• K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law
• Excluding induced subgraphs: quadrilaterals
• Excluding Induced Subgraphs III: A General Asymptotic
• Extremal Graph Problems for Graphs with a Color-Critical Vertex
• Model Theory
• Hereditary Properties of Triple Systems
• Projections of Bodies and Hereditary Properties of Hypergraphs
• On the Number of Graphs Without Large Cliques
• Independent sets in hypergraphs
• A Guide to NIP Theories
• Hereditary properties of combinatorial structures: Posets and oriented graphs
• The penultimate rate of growth for graph properties
• The asymptotic number of triple systems not containing a fixed one
• Measures on monotone properties of graphs

This page was built for publication: Structure and enumeration theorems for hereditary properties in finite relational languages