Countable homogeneous multipartite graphs
From MaRDI portal
Publication:649012
Recommendations
- Countable connected-homogeneous graphs
- Homogeneous coloured multipartite graphs
- Counting graph homomorphisms involving complete graphs
- Counting graph homomorphisms
- Edge partitions of the countable triangle free homogeneous graph
- Homogeneous factorisations of complete multipartite graphs
- Counting partitions of graphs
- scientific article; zbMATH DE number 3920503
- On the number of homogeneous subgraphs of a graph
- Connected-homomorphism-homogeneous graphs
Cites work
- scientific article; zbMATH DE number 3819758 (Why is no real title available?)
- Countable 1-transitive coloured linear orderings II
- Countable Homogeneous Tournaments
- Countable Ultrahomogeneous Undirected Graphs
- Countable homogeneous and partially homogeneous ordered structures
- Countable homogeneous coloured partial orders
- Countable homogeneous partially ordered sets
- Countable homogeneous relational structures and ℵ0-categorical theories
- Countable, 1-transitive, coloured linear orderings. I.
- Homogeneous coloured multipartite graphs
- Homogeneous graphs
- Infinite homogeneous bipartite graphs with unequal sides
- On countable stable structures which are homogeneous for a finite relational language
- Smoothly Embeddable Subgraphs
- Stable Finitely Homogeneous Structures
- Stable structures homogeneous for a finite binary language
- The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
Cited in
(15)- Expansions of ultrahomogeneous graphs
- Permutation groups with small orbit growth
- Homogeneous ordered graphs, metrically homogeneous graphs, and beyond. Volume 2. 3-multi-graphs and 2-multi-tournaments
- Infinite homogeneous bipartite graphs with unequal sides
- Countable connected-homogeneous graphs
- Homogeneous completely simple semigroups
- Homogeneous coloured multipartite graphs
- Homogeneous 2-partite digraphs
- On sets with rank one in simple homogeneous structures
- Complexities of Relational Structures
- Binary simple homogeneous structures are supersimple with finite rank
- Homogeneous 1-based structures and interpretability in random structures
- Countable homogeneous linearly ordered posets
- WQO dichotomy for 3-graphs
- Classification of countable 2-colored ultrahomogeneous graphs where each color class forms a disjoint union of cliques
This page was built for publication: Countable homogeneous multipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q649012)