Sharp asymptotics for the Lov\'asz number of random circulant graphs
We study the LOV\'ASZ number of dense random circulant graphs generated by independent Bernoulli bits indexed by cyclic distances. Although only $O(n)$ independent random inputs determine $O(n^2)$ globally dependent edge indicators, we prove sharp expectation asymptotics along all odd orders, including composite orders...