Jumps in speeds of hereditary properties in finite relational languages
From MaRDI portal
Publication:2668015
Recommendations
- A jump to the Bell number for hereditary graph properties
- The unlabelled speed of a hereditary graph property
- \(\mathrm{VC}_{\ell }\)-dimension and the jump to the fastest speed of a hereditary \(\mathcal {L}\)-property
- Hereditary properties of ordered graphs
- The speed of hereditary properties of graphs
Cites work
- \(\mathrm{VC}_{\ell }\)-dimension and the jump to the fastest speed of a hereditary \(\mathcal {L}\)-property
- A jump to the Bell number for hereditary graph properties
- Binary relational structures having only countably many nonisomorphic substructures
- Classification theory and the number of non-isomorphic models.
- Coinductive ℵ0-categorical theories
- Every graph is contained in a sparsest possible balanced graph
- Extensions of the linear bound in the Füredi-Hajnal conjecture
- Growth Rates in Infinite Graphs and Permutation Groups
- Hereditary properties of combinatorial structures: Posets and oriented graphs
- Hereditary properties of partitions, ordered graphs and ordered hypergraphs
- Hereditary properties of tournaments
- scientific article; zbMATH DE number 3825706 (Why is no real title available?)
- scientific article; zbMATH DE number 53151 (Why is no real title available?)
- scientific article; zbMATH DE number 970795 (Why is no real title available?)
- Mutually algebraic structures and expansions by predicates
- On growth rates of closed permutation classes
- On possible Turán densities
- On the size of hereditary classes of graphs
- Projections of Bodies and Hereditary Properties of Hypergraphs
- Relational structures determined by their finite induced substructures
- Stable structures with few substructures
- Strongly balanced graphs and random graphs
- Structure and enumeration theorems for hereditary properties in finite relational languages
- The elementary diagram of a trivial, weakly minimal structure is near model complete
- The number of hypergraphs without linear cycles
- The penultimate rate of growth for graph properties
- The speed of hereditary properties of graphs
- The structure of almost all graphs in a hereditary property
- Uniformly bounded arrays and mutually algebraic structures
Cited in
(11)- Structure and enumeration theorems for hereditary properties in finite relational languages
- 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
- Jumps in speeds of hereditary properties in finite relational languages
- Well-quasi-ordering and Embeddability of Relational Structures
- How I got to like graph polynomials
- Existential characterizations of monadic NIP
- Indivisibility for classes of graphs
- On first-order transductions of classes of graphs
This page was built for publication: Jumps in speeds of hereditary properties in finite relational languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2668015)