Elsevier

European Journal of Combinatorics

Volume 66, December 2017, Pages 101-109
European Journal of Combinatorics

Fractal property of the graph homomorphism order

https://doi.org/10.1016/j.ejc.2017.06.017Get rights and content
Under an Elsevier user license
open archive

Abstract

We show that every interval in the homomorphism order of finite undirected graphs is either universal or a gap. Together with density and universality this “fractal” property contributes to the spectacular properties of the homomorphism order.

We first show the fractal property by using Sparse Incomparability Lemma and then by a more involved elementary argument.

Cited by (0)