Universality of intervals of line graph order
classification
🧮 math.CO
cs.DM
keywords
graphslinedegreeeveryfinitehomomorphismmaximalorder
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.