arXiv (All)
open access
Monochromatic cycle partitions in 3-mean edge-colourings
Given $r \in \mathbb{N}$ and an edge-coloured complete graph such that the average number of colours incident with a vertex is at most $r$, Conlon and Stein asked whether there is a vertex partition into a bounded number of monochromatic cycles, and proved this for $r=2$. We settle the first open ca
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
- A counterexample to the quantum Hedetniemi conjecture#1034490
- Logarithmic basis number of graphs and regular matroids#1084361
- On Edge Coloring of Multigraphs#1082904
- Acyclic Dichromatic Number of Tournaments: these are the Champions#1327463
- On the Number of Almost Empty Monochromatic Triangles#999723
Record · ID 1326368
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