Jumps in speeds of hereditary properties in finite relational languages

DOI10.1016/j.jctb.2021.12.004OpenAlexW2795088634MaRDI QIDQ2668015

Michael Chris Laskowski, Caroline A. Terry

Publication date: 3 March 2022

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

model theoryextremal combinatoricshereditary properties

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Enumeration in graph theory (05C30) Classification theory, stability, and related concepts in model theory (03C45)

Related Items (4)

Mutual algebraicity and cellularity ⋮ COUNTING SIBLINGS IN UNIVERSAL THEORIES ⋮ Monadic stability and growth rates of ω$\omega$‐categorical structures ⋮ A jump to the Narayana number for hereditary properties of ordered 3-uniform hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On possible Turán densities
• The structure of almost all graphs in a hereditary property
• Uniformly bounded arrays and mutually algebraic structures
• Hereditary properties of partitions, ordered graphs and ordered hypergraphs
• The elementary diagram of a trivial, weakly minimal structure is near model complete
• Hereditary properties of tournaments
• Classification theory and the number of non-isomorphic models.
• On the size of hereditary classes of graphs
• The number of hypergraphs without linear cycles
• Structure and enumeration theorems for hereditary properties in finite relational languages
• The speed of hereditary properties of graphs
• On growth rates of closed permutation classes
• A jump to the Bell number for hereditary graph properties
• Extensions of the linear bound in the Füredi-Hajnal conjecture
• Growth Rates in Infinite Graphs and Permutation Groups
• Every graph is contained in a sparsest possible balanced graph
• Relational structures determined by their finite induced substructures
• Strongly balanced graphs and random graphs
• Binary relational structures having only countably many nonisomorphic substructures
• 𝑉𝐶_{ℓ}-dimension and the jump to the fastest speed of a hereditary ℒ-property
• Projections of Bodies and Hereditary Properties of Hypergraphs
• Mutually algebraic structures and expansions by predicates
• Coinductive ℵ₀-categorical theories
• Hereditary properties of combinatorial structures: Posets and oriented graphs
• Stable structures with few substructures
• The penultimate rate of growth for graph properties

This page was built for publication: Jumps in speeds of hereditary properties in finite relational languages