Maximising homomorphism counts between digraphs

Lukas Lüchtrath, Christian Mönch

We prove a Sidorenko-type inequality for directed trees: for every oriented tree $T$ on $k$ vertices and every finite directed graph $G$, the homomorphism count hom$(T,G)$ is bound…