Fractal property of the graph homomorphism order
From MaRDI portal
Publication:2403692
DOI10.1016/j.ejc.2017.06.017zbMath1369.05149arXiv1606.07881OpenAlexW2964188288MaRDI QIDQ2403692
Jaroslav Nešetřil, Yangjing Long, Jan Hubička, Jiří Fiala
Publication date: 11 September 2017
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.07881
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- An universality argument for graph homomorphisms
- Universality of intervals of line graph order
- Chromatically optimal rigid graphs
- Color-families are dense
- Universal partial order represented by means of oriented trees and other simple graphs
- Duality theorems for finite structures (characterising gaps and good characterisations)
- Relations (graphs) with given finitely generated semigroups
- Constraints, MMSNP and expander relational structures
- On universal partly ordered sets and classes
- Representing monoids by mappings preserving equivalences
- Some examples of universal and generic partial orders
- Graph Theory and Probability. II
- The Homomorphism Structure of Classes of Graphs
- Finite paths are universal