arXiv (All)
open access
Bounded Twin-Width Tournaments are $\dchi$-Bounded
For a tournament $T$ and a vertex ordering $\prec$, let $T^{\prec}$ be the graph of backward arcs in $\prec$. The diclique number of a tournament is $\domega(T)=\min_{\prec}ω(T^{\prec})$, and the dichromatic number is $\dchi(T)=\min_{\prec}χ(T^{\prec})$. We prove a mixed parameter transfer theorem:
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
- Bounded Twin-Width Tournaments are $\dchi$-Bounded#920660
- Digraphs of Large Girth and Dichromatic Number in Tournaments with Large Dichromatic Number#1036284
- Fractional Dichromatic Number and Domination in Tournaments#1129783
- On Edge Coloring of Multigraphs#1082904
- Explicit and logarithmically improved chromatic bounds for $(P_2\cup P_3)$-free graphs#987759
Record · ID 924894
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