Homogeneous coloured multipartite graphs
| Autor: | John K. Truss, Deborah C. Lockett |
|---|---|
| Rok vydání: | 2014 |
| Předmět: |
Discrete mathematics
Class (set theory) Mathematics::Combinatorics Quantum Physics Combinatorics Mathematics::Logic Multipartite Computer Science::Discrete Mathematics Homogeneous FOS: Mathematics Mathematics - Combinatorics Discrete Mathematics and Combinatorics Countable set Pairwise comparison Combinatorics (math.CO) Finite set Mathematics |
| Zdroj: | European Journal of Combinatorics. 42:217-242 |
| ISSN: | 0195-6698 |
| DOI: | 10.1016/j.ejc.2014.06.006 |
| Popis: | 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. Comment: 27 pages |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect