betaFeedback

WorksMathematics

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 H⃗\vec H of a graph HH is relatively Sidorenko if hom⁡(H⃗,G⃗)≥2−e(H)hom⁡(H,G)\hom(\vec H,\vec G) \ge 2^{-e(H)}\hom(H,G) for every oriented graph G⃗\vec G with underlying graph GG, 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.

Paper details

vlnc:W_aeknfhjg
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC-BY-NC-SA-4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

GPT-5.5 (bare)

View statement
Looking for related papers…