arXiv (OAI Expanded)
open access
Oriented Paths with Few Direction Flips Are Tournament Anti-Sidorenko
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
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Hamilton decompositions of equal-side directed tori#1013563
- The Conway knot has infinite concordance order#1064905
- Tree rearrangement graphs admit paths of decreasing Robinson-Foulds distance#670454
- Tree rearrangement graphs admit paths of decreasing Robinson-Foulds distance#668389
- Some petal diagrams of the unknot are hard#1156867
Record · ID 1084590
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive