Countable homogeneous multipartite graphs
From MaRDI portal
Publication:649012
DOI10.1016/J.EJC.2011.04.004zbMATH Open1230.05247OpenAlexW1995017815MaRDI QIDQ649012FDOQ649012
Authors: Tristan Jenkinson, Daniel Seidel, John K. Truss
Publication date: 29 November 2011
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2011.04.004
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
- Homogeneous graphs
- Smoothly Embeddable Subgraphs
- Countable Ultrahomogeneous Undirected Graphs
- Countable homogeneous partially ordered sets
- Infinite homogeneous bipartite graphs with unequal sides
- Countable homogeneous coloured partial orders
- Title not available (Why is that?)
- Homogeneous coloured multipartite graphs
- The classification of countable homogeneous directed graphs and countable homogeneous đ-tournaments
- Countable Homogeneous Tournaments
- Countable homogeneous and partially homogeneous ordered structures
- Countable homogeneous relational structures and â”0-categorical theories
- On countable stable structures which are homogeneous for a finite relational language
- Stable structures homogeneous for a finite binary language
- Countable, 1-transitive, coloured linear orderings. I.
- Stable Finitely Homogeneous Structures
- Countable 1-transitive coloured linear orderings II
Cited In (13)
- Expansions of ultrahomogeneous graphs
- Homogeneous coloured multipartite graphs
- Homogeneous 1âbased structures and interpretability in random structures
- Countable homogeneous linearly ordered posets
- Permutation groups with small orbit growth
- Binary simple homogeneous structures are supersimple with finite rank
- Complexities of Relational Structures
- WQO dichotomy for 3-graphs
- On sets with rank one in simple homogeneous structures
- Countable connected-homogeneous graphs
- Classification of countable 2-colored ultrahomogeneous graphs where each color class forms a disjoint union of cliques
- Homogeneous 2-partite digraphs
- HOMOGENEOUS COMPLETELY SIMPLE SEMIGROUPS
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)