Countable Ultrahomogeneous Undirected Graphs
From MaRDI portal
Publication:3924176
Cites work
- A family of countable homogeneous graphs
- Countable homogeneous partially ordered sets
- Countable homogeneous relational structures and ℵ0-categorical theories
- Homogeneous graphs
- Sur l'extension aux relations de quelques propriétés des ordres
- There are four countable ultrahomogeneous graphs without triangles
Cited in
(only showing first 100 items - show all)- Isomorphic and strongly connected components
- \(k\)-CS-transitive infinite graphs
- Ramsey precompact expansions of homogeneous directed graphs
- Countable homogeneous multipartite graphs
- Countable homogeneous lattices
- Asymptotic enumeration and a 0-1 law for $m$-clique free graphs
- On countable stable structures which are homogeneous for a finite relational language
- Finite homomorphism-homogeneous tournaments with loops
- Countable Homogeneous Tournaments
- On k-homogeneous posets and graphs
- On the divisibility of homogeneous hypergraphs
- Inexhaustible homogeneous structures
- Two Fraïssé-style theorems for homomorphism-homogeneous relational structures
- Homomorphisms and amalgamation
- Cyclic automorphisms of a countable graph and random sum-free sets
- 1-homogeneous graphs
- Metric spaces are Ramsey
- Homogeneous and strictly homogeneous criteria for partial structures
- Finite presentation of homogeneous graphs, posets and Ramsey classes
- Glasner's problem for Polish groups with metrizable universal minimal flow
- Homogeneous Cayley objects
- Countable homogeneous partially ordered sets
- Rank three permutation groups with rank three subconstituents
- Infinite homogeneous bipartite graphs with unequal sides
- The classification of homogeneous finite-dimensional permutation structures
- Countable connected-homogeneous graphs
- Countable, 1-transitive, coloured linear orderings. I.
- A survey of homogeneous structures
- Some universal graphs
- Homogeneous coloured multipartite graphs
- Homogeneous 2-partite digraphs
- On sets with rank one in simple homogeneous structures
- Set-homogeneous directed graphs
- Coloring of universal graphs
- Maximal chains of isomorphic subgraphs of countable ultrahomogeneous graphs
- The indivisibility of the homogeneous \(K_ n\)-free graphs
- Distanced graphs
- Some more notions of homomorphism-homogeneity
- Ramsey theory for countable binary homogeneous structures
- Universal \(H\)-colourable graphs
- A census of infinite distance-transitive graphs
- Stable Finitely Homogeneous Structures
- Retractions of reversible structures
- Age and weak indivisibility
- Dense free subgroups of automorphism groups of homogeneous partially ordered sets
- Invariant measures via inverse limits of finite structures
- Reversibility of extreme relational structures
- \(>k\)-homogeneous infinite graphs
- Topological 2-generation of automorphism groups of countable ultrahomogeneous graphs
- Ramsey classes of topological and metric spaces
- For graphs there are only four types of hereditary Ramsey classes
- Counting unlabeled structures
- Automorphism groups of finite topological rank
- The Urysohn sphere is oscillation stable
- Binary simple homogeneous structures are supersimple with finite rank
- Forbidden substructures and combinatorial dichotomies: WQO and universality
- Universal elements and the complexity of certain classes of infinite graphs
- Homomorphism-homogeneous graphs
- Ramsey-type properties of relational structures
- Cohen-like first order structures
- The age of a relational structure
- Reducts of the Henson graphs with a constant
- Connected-homomorphism-homogeneous graphs
- Countable homogeneous linearly ordered posets
- A characterization of retracts in certain Fraïssé limits
- Unary functions
- Maximally embeddable components
- All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)
- On a \(\vec C_4\)-ultrahomogeneous oriented graph
- EPPA numbers of graphs
- Homomorphism-homogeneity classes of countable \(L\)-colored graphs
- Characterization of the finite C-MH-homogeneous graphs
- Homogeneity of inverse semigroups
- IB-homogeneous graphs
- The poset of morphism-extension classes of countable graphs
- Binary simple homogeneous structures
- \(2^{\aleph_{0}}\) pairwise nonisomorphic maximal-closed subgroups of \(\mathrm{Sym}(\mathbb N)\) via the classification of the reducts of the Henson digraphs
- Quantifier-eliminable locally finite graphs
- Reversibility of disconnected structures
- Metrically homogeneous graphs of diameter \(3\)
- The classification of connected-homogeneous digraphs with more than one end
- Constraint satisfaction problems for reducts of homogeneous graphs
- Countable homogeneous Steiner triple systems avoiding specified subsystems
- Universality vs genericity and \(C_4\)-free graphs
- The independence number of HH-homogeneous graphs and a classification of MB-homogeneous graphs
- On countable homogeneous \(3\)-hypergraphs
- Permutation monoids and MB-homogeneity for graphs and relational structures
- From the Coxeter graph to the Klein graph
- On \(k\)-connected-homogeneous graphs
- On constraints and dividing in ternary homogeneous structures
- The Hrushovski property for hypertournaments and profinite topologies
- Polish topologies on endomorphism monoids of relational structures
- Homogeneous 1-based structures and interpretability in random structures
- A unified approach to structural limits and limits of graphs with bounded tree-depth
- Finite 3-connected-set-homogeneous locally \(2\mathbf{K}_n\) graphs and \(s\)-arc-transitive graphs
- Extending partial isometries of antipodal graphs
- Locally finite homogeneous graphs
- Ultrahomogeneous tensor spaces
- Siblings of an \(\aleph_0\)-categorical relational structure
- Set‐homogeneous hypergraphs
This page was built for publication: Countable Ultrahomogeneous Undirected Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3924176)