arXiv (All)
open access
Digraphs of Large Girth and Dichromatic Number in Tournaments with Large Dichromatic Number
In the 1960s, Erdős and Hajnal conjectured that every graph with sufficiently large chromatic number contains a subgraph of large girth (size of a smallest cycle) and large chromatic number. In this paper, we prove that every tournament with sufficiently large dichromatic number contains a subdigrap
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
- On Edge Coloring of Multigraphs#1082904
- Fractional Dichromatic Number and Domination in Tournaments#1129783
- An Exact Dominant Degree Condition for Transitive Tournament Factors in Digraphs#986319
- Bounded Twin-Width Tournaments are $\dchi$-Bounded#924894
- Bounded Twin-Width Tournaments are $\dchi$-Bounded#920660
Record · ID 1036284
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