Universality of intervals of line graph order
Combinatorics
2014-04-22 v2 Discrete Mathematics
Abstract
We prove that for every the homomorphism order of the class of line graphs of finite graphs with maximal degree is universal. This means that every finite or countably infinite partially ordered set may be represented by line graphs of graphs with maximal degree ordered by the existence of a homomorphism.
Keywords
Cite
@article{arxiv.1402.3736,
title = {Universality of intervals of line graph order},
author = {Jiří Fiala and Jan Hubička and Yangjing Long},
journal= {arXiv preprint arXiv:1402.3736},
year = {2014}
}
Comments
13 pages, 8 figures, accepted to European Journal of Combinatorics