Size of the largest component in a critical graph (Q2298120)

Summary: In this paper, by the branching process and the martingale method, we prove that the size of the largest component in the critical random intersection graph \(G \left(n, \left[n^{5 / 3}\right], p\right)\) is asymptotically of order \(n^{2 / 3}\) and the width of scaling window is \(n^{- 1 / 3}\).