arXiv (All)
open access
On Tournament Anti-Sidorenko Orientations of Trees
An oriented graph $\vec{H}$ is said to be tournament anti-Sidorenko if the homomorphism density of $\vec{H}$ in any tournament $\vec{T}$ is bounded above by the homomorphism density of $\vec{H}$ in a large uniformly random tournament. We prove the following: (1) Every oriented path with at least t
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
- Recursive Paintboxes and the Martin Boundary of the Hoffman Rooted-Tree Graph#1078206
- Impartial removing games on grid graphs#1084015
- A note on efficient k-limited broadcast domination in graphs#659009
- A note on efficient k-limited broadcast domination in graphs#656873
- Maximum-Entropy Random Walks on Hypergraphs#985016
Record · ID 1062650
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