An universality argument for graph homomorphisms

DOI10.1016/j.endm.2015.06.087zbMath1346.05190OpenAlexW2197064339MaRDI QIDQ322345

Jiří Fiala, Jan Hubička, Yangjing Long

Publication date: 14 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.06.087

zbMATH Keywords

homomorphism order of graphsuniversality of homomorphism order

Mathematics Subject Classification ID

Representation theory of groups (20C99) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Fractal property of the graph homomorphism order

Cites Work

• Unnamed Item
• Unnamed Item
• Graph minors. XX: Wagner's conjecture
• Universality of intervals of line graph order
• Universal partial order represented by means of oriented trees and other simple graphs
• Labeled posets are universal
• Some examples of universal and generic partial orders
• The Homomorphism Structure of Classes of Graphs
• Mathematical Foundations of Computer Science 2005
• Finite paths are universal

This page was built for publication: An universality argument for graph homomorphisms