Maximising homomorphism counts between digraphs

TL;DR

This paper establishes a new inequality for homomorphism counts from directed trees to host digraphs, showing pure star structures maximize these counts, with implications for graph models and limits.

Contribution

It proves a Sidorenko-type inequality for directed trees, demonstrating pure in- and out-star graphs maximize homomorphism counts into any host digraph.

Findings

Pure in- and out-star graphs maximize homomorphism counts among directed trees.

The proof uses combinatorial leaf-reallocation and Hölder's inequality.

Implications for random directed graphs and local weak limits.

Abstract

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 bounded above by the maximum of the two pure star counts hom$(S_{0,k-1},G)$ and hom$(S_{k-1,0},G)$. In other words, among all directed trees on $k$ vertices, the pure in- and out-stars maximise the homomorphism count into host digraphs. The proof is purely combinatorial, based on an iterative leaf-reallocation scheme combined with H\"{o}lder's inequality. We further investigate the corresponding homomorphism order on directed trees, discuss refinements via tail-truncation and pointwise bounds for rooted host graphs, and record several consequences, e.g. for random directed graph models and local weak limits, where the inequality reduces tree statistics to controlled pure in- and out-degree moments.