Randomly colored graphs show two regimes: subgraph sizes concentrate when the normalized degree norm ζ is o(1), but monochromatic edges may deviate from their mean with positive probability when ζ is Θ(1) and color imbalance persists.
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
Randomly colored graphs show two regimes: subgraph sizes concentrate when the normalized degree norm ζ is o(1), but monochromatic edges may deviate from their mean with positive probability when ζ is Θ(1) and color imbalance persists.