arXiv (All)
open access
Fractional Dichromatic Number and Domination in Tournaments
Bourneuf, Charbit and Thomassé [BCT25] showed that the domination number of a tournament can be bounded as a function of its fractional dichromatic number. The function proved was exponential and the tools were based on VC-dimension. In this paper, we present two new proofs of this theorem. The fi
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
- Digraphs of Large Girth and Dichromatic Number in Tournaments with Large Dichromatic Number#1036284
- Bounded Twin-Width Tournaments are $\dchi$-Bounded#924894
- Bounded Twin-Width Tournaments are $\dchi$-Bounded#920660
- Constructions for positional games and applications to domination games / Ali Deniz Bagdas, Dennis Clemens, Fabian Hamann, Yannick Mogge#921993
- Explicit and logarithmically improved chromatic bounds for $(P_2\cup P_3)$-free graphs#987759
Record · ID 1129783
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