2604.00771 Chromatic Number of Random Geometric Graphs Concentrates Around Root of n Over ln n
Study χ(G(n,r)) for n=100-10000 nodes uniformly in [0,1]² with connection radius r chosen at the connectivity threshold r_c = √(ln n / (πn)). Empirically: χ concentrates around c·√(n/ln n) with c=1.