Canonical labelling of sparse random graphs
<|reference_start|>Canonical labelling of sparse random graphs: We show that if $p=O(1/n)$, then the Erd\H{o}s-R\'{e}nyi random graph $G(n,p)$ with high probability admits a canonical labeling computable in time $O(n\log n)$. Combined with the previous results on the canonization of random graphs, this implies that $G(n,p)$ with high probability admits a polynomial-time canonical labeling whatever the edge probability function $p$. Our algorithm combines the standard color refinement routine with simple post-processing based on the classical linear-time tree canonization. Noteworthy, our analysis of how well color refinement performs in this setting allows us to complete the description of the automorphism group of the 2-core of $G(n,p)$.<|reference_end|>
@article{verbitsky2024canonical,
    title={Canonical labelling of sparse random graphs},
    author={Oleg Verbitsky and Maksim Zhukovskii},
    journal={arXiv preprint arXiv:2409.18109},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.18109},
    primaryClass={cs.DM math.CO}
}