An universality argument for graph homomorphisms

DOI10.1016/J.ENDM.2015.06.087zbMATH Open1346.05190OpenAlexW2197064339MaRDI QIDQ322345FDOQ322345

Authors: 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

Recommendations

• Universal partial order represented by means of oriented trees and other simple graphs
• Universality of intervals of line graph order
• On universal graphs for hom-properties
• Fractal property of the graph homomorphism order
• scientific article; zbMATH DE number 4170938

zbMATH Keywords

homomorphism order of graphsuniversality of homomorphism order

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Graph minors. XX: Wagner's conjecture
• 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
• Title not available (Why is that?)
• The Homomorphism Structure of Classes of Graphs
• Mathematical Foundations of Computer Science 2005
• Finite paths are universal
• Universality of intervals of line graph order

Cited In (9)

• Labeled posets are universal
• Title not available (Why is that?)
• Graph-Theoretic Concepts in Computer Science
• Finite paths are universal
• Universality of intervals of line graph order
• On the homomorphism order of labeled posets
• Fractal property of the graph homomorphism order
• Universal partial order represented by means of oriented trees and other simple graphs
• Polyadic sets and homomorphism counting

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322345)