no. 17 · Wednesday 18 November 2026
Sidorenko Inequalities in Oriented Graphs
Abstract
We introduce relative Sidorenko and relative anti-Sidorenko inequalities for oriented graphs, strengthening the corresponding well-studied notions for tournaments by allowing arbitrary host graphs. An orientation $\vec H$ of a graph $H$ is relatively Sidorenko if $\hom(\vec H,\vec G) \ge 2^{-e(H)}\hom(H,G)$ for every oriented graph $\vec G$ with underlying graph $G$, and relatively anti-Sidorenko if the reverse inequality holds. We provide a complete characterisation of the class of connected relatively Sidorenko graphs in terms of weakly norming graphs, and exhibit several families of relatively Sidorenko and relatively anti-Sidorenko oriented graphs. Despite the substantially stronger definitions, many known tournament Sidorenko and anti-Sidorenko examples satisfy the relative inequalities, suggesting a broader theory of these phenomena in arbitrary host graphs and motivating several new structural and classification problems.
- comments
- 27 pages, 3 figures. Comments welcome
- fields
- Combinatorics