2000 character limit reached
Universality of intervals of line graph order (1402.3736v2)
Published 16 Feb 2014 in math.CO and cs.DM
Abstract: We prove that for every $d\geq 3$ the homomorphism order of the class of line graphs of finite graphs with maximal degree $d$ is universal. This means that every finite or countably infinite partially ordered set may be represented by line graphs of graphs with maximal degree $d$ ordered by the existence of a homomorphism.