arXiv (All)
open access
Multiset Colorings of Random Graphs Across Density Regimes
We show that almost every graph admits a partition of its vertex set into three parts such that no two adjacent vertices have the same number of neighbors in each of the three parts. Equivalently, for $G\sim G(n,1/2)$, $χ_m(G)\le3$ with high probability, improving the previously known bound of five.
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
- Exact three-component covers in 2-coloured random bipartite graphs#1011301
- Polychromatic Partitions, Kingman Theory, and Ewens Sampling Formula#793367
- Polychromatic Partitions, Kingman Theory, and Ewens Sampling Formula#789363
- $(2,\mathcal{F})$-Avoiding Coloring and B-Coloring under Bipartite Exclusions#1144883
- More on Rainbow Cliques in Edge-Colored Graphs#1122876
Record · ID 1049104
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