Year: 2026
Type: preprint
Abstract: An oriented graph $H$ is said to be tournament anti-Sidorenko (TAS) if a uniformly random tournament asymptotically maximizes the homomorphism density of $H$ among all tournaments. For an oriented path $P$, a direction flip is a non-leaf source or sink. Sah, Sawhney and Zhao proved that consistently directed paths (paths with no direction flips) are TAS. He, Mani, Nie, Tung and Wei proved that for $3\le k\le 7$, every oriented path of length $k$ with exactly one direction flip is TAS, and Chen, Clemen and Noel recently extended this to every $k\ge 3$. In this paper, we extend these results by proving that for every integer $r\ge 0$, every oriented path of length at least $1665r+1454$ with $r$ direction flips is tournament anti-Sidorenko.
Source: arXiv (Cornell University)
Authors: Chen, Hao, Lin, Yupeng
Institution: University of Science and Technology of China
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
Awards: G1330075977, G1836446064, G442152759
OpenAlex ID: W7213277102