Distinguishing Vertices of Random Graphs

DOI10.1016/S0304-0208(08)73545-XzbMath0495.05057OpenAlexW12328562MaRDI QIDQ3958505

Béla Bollobás

Publication date: 1982

Published in: Graph Theory, Proceedings of the Conference on Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-0208(08)73545-x

zbMATH Keywords

distance sequencerandom labelled graphrandom r-regular graphs

Mathematics Subject Classification ID

Combinatorial probability (60C05) Graph theory (05C99)

Related Items (10)

Local maxima of the systole function ⋮ Random quantum graphs ⋮ Efficient random graph matching via degree profiles ⋮ Exact matching of random graphs with constant correlation ⋮ Spectral graph matching and regularized quadratic relaxations. I: Algorithm and Gaussian analysis ⋮ Unnamed Item ⋮ Isomorphism for random \(k\)-uniform hypergraphs ⋮ Improved random graph isomorphism ⋮ Distance degree regular graphs and distance degree injective graphs: an overview ⋮ Identifiability of Graphs with Small Color Classes by the Weisfeiler--Leman Algorithm

This page was built for publication: Distinguishing Vertices of Random Graphs