arXiv (OAI Expanded)
open access
A universal dichotomy for concentration in randomly colored graphs
Let $ζ$ be Euclidean norm of the degree sequence of a graph normalized by the graph size. We prove that when the vertices of a graph are randomly colored with $s$ colors such that the fraction of vertices in each color class is bounded away from zero, only two asymptotic regimes emerge. If $ζ=o(1)$,
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 universal dichotomy for concentration in randomly colored graphs#924557
- Sparse chromatic graphs and the complete-graph triangle bound#1062147
- Bounded chromatic number of graphs with small clique number and large minimum degree#1050283
- Descriptive complexity results related to uniform distribution theory (Analytic Number Theory and Related Topics)#378247
- Descriptive complexity results related to uniform distribution theory (Analytic Number Theory and Related Topics)#378240
Record · ID 920325
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