Homogeneous coloured multipartite graphs

DOI10.1016/J.EJC.2014.06.006zbMATH Open1300.05130arXiv1406.6517OpenAlexW2050475094MaRDI QIDQ404461FDOQ404461

Authors: Deborah C. Lockett, John K. Truss 

Publication date: 4 September 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: We classify the countable homogeneous coloured multipartite graphs with any finite number of parts. By Fraisse's Theorem this amounts to classifying the families F of pairwise non-embeddable finite coloured multipartite graphs for which the class Forb(F) of multipartite graphs which forbid these is an amalgamation class. We show that once we understand such families F in the quadripartite case, things do not become any more complicated for larger numbers of parts.

Full work available at URL: https://arxiv.org/abs/1406.6517

Recommendations

• Countable homogeneous multipartite graphs
• Countable homogeneous coloured partial orders
• Homogeneous ordered graphs, metrically homogeneous graphs, and beyond. Volume 2. 3-multi-graphs and 2-multi-tournaments
• The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
• Infinite imprimitive homogeneous 3-edge-colored complete graphs

zbMATH Keywords

countable homogeneous coloured multipartite graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Countable Ultrahomogeneous Undirected Graphs
• Countable homogeneous partially ordered sets
• Countable homogeneous coloured partial orders
• The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
• Countable Homogeneous Tournaments
• Countable homogeneous multipartite graphs

Cited In (5)

• Countable homogeneous multipartite graphs
• Binary simple homogeneous structures
• Permutation groups with small orbit growth
• Countable homogeneous coloured partial orders
• Classification of countable 2-colored ultrahomogeneous graphs where each color class forms a disjoint union of cliques

This page was built for publication: Homogeneous coloured multipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q404461)