Countable homogeneous multipartite graphs

DOI10.1016/j.ejc.2011.04.004zbMath1230.05247OpenAlexW1995017815MaRDI QIDQ649012

Daniel Seidel, Tristan Jenkinson, 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

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Related Items

On sets with rank one in simple homogeneous structures ⋮ Homogeneous coloured multipartite graphs ⋮ Homogeneous 1‐based structures and interpretability in random structures ⋮ HOMOGENEOUS COMPLETELY SIMPLE SEMIGROUPS ⋮ Countable homogeneous linearly ordered posets ⋮ Binary simple homogeneous structures are supersimple with finite rank ⋮ WQO dichotomy for 3-graphs ⋮ Permutation groups with small orbit growth ⋮ Complexities of Relational Structures

Cites Work

• Unnamed Item
• Unnamed Item
• Homogeneous coloured multipartite graphs
• On countable stable structures which are homogeneous for a finite relational language
• Stable structures homogeneous for a finite binary language
• Countable homogeneous partially ordered sets
• Homogeneous graphs
• Countable, 1-transitive, coloured linear orderings. I.
• Infinite homogeneous bipartite graphs with unequal sides
• Countable homogeneous coloured partial orders
• Stable Finitely Homogeneous Structures
• Countable Ultrahomogeneous Undirected Graphs
• Smoothly Embeddable Subgraphs
• The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
• Countable 1-transitive coloured linear orderings II
• Countable Homogeneous Tournaments
• Countable homogeneous relational structures and ℵ₀-categorical theories

This page was built for publication: Countable homogeneous multipartite graphs