Homogeneous coloured multipartite graphs
Combinatorics
2014-06-26 v1
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.
Cite
@article{arxiv.1406.6517,
title = {Homogeneous coloured multipartite graphs},
author = {Deborah C Lockett and John K Truss},
journal= {arXiv preprint arXiv:1406.6517},
year = {2014}
}
Comments
27 pages