Two Fraïssé-style theorems for homomorphism-homogeneous relational structures
From MaRDI portal
Publication:2279998
DOI10.1016/j.disc.2019.111674zbMath1429.05141arXiv1812.01934OpenAlexW2979226147MaRDI QIDQ2279998
Publication date: 17 December 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.01934
Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (2)
IB-homogeneous graphs ⋮ The independence number of HH-homogeneous graphs and a classification of MB-homogeneous graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simplicity of some automorphism groups.
- Some more notions of homomorphism-homogeneity
- Reducts of the generic digraph
- Posets, homomorphisms and homogeneity
- Countable homogeneous partially ordered sets
- A survey of homogeneous structures
- Permutation monoids and MB-homogeneity for graphs and relational structures
- Homomorphism-homogeneous partially ordered sets
- Fraïssé limits, Ramsey theory, and topological dynamics of automorphism groups
- Towards a Ryll-Nardzewski-type theorem for weakly oligomorphic structures
- Homomorphism-homogeneous graphs
- Oligomorphic transformation monoids and homomorphism-homogeneous structures
- The Bergman property for endomorphism monoids of some Fraïssé limits
- Generic Automorphisms of Homogeneous Structures
- Homomorphism-Homogeneous Relational Structures
- Turbulence, amalgamation, and generic automorphisms of homogeneous structures
- Finite homomorphism-homogeneous tournaments with loops
- Countable Ultrahomogeneous Undirected Graphs
- The Small Index Property for ω‐Stable ω‐Categorical Structures and for the Random Graph
- The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
- UNCOUNTABLE COFINALITIES OF PERMUTATION GROUPS
- Countable Homogeneous Tournaments
- Reconstruction of homogeneous relational structures
- The random graph
- STACS 2005
- Notes on infinite permutation groups
This page was built for publication: Two Fraïssé-style theorems for homomorphism-homogeneous relational structures