A dichotomy governs concentration in randomly colored graphs: when the normalized degree sequence norm ζ is o(1), induced subgraph sizes concentrate; when ζ is Θ(1), monochromatic edge count M concentrates or not based on color balance.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A universal dichotomy for concentration in randomly colored graphs
A dichotomy governs concentration in randomly colored graphs: when the normalized degree sequence norm ζ is o(1), induced subgraph sizes concentrate; when ζ is Θ(1), monochromatic edge count M concentrates or not based on color balance.