Universality of intervals of line graph order
Abstract
We prove that for every d≥ 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.