Distinguishing Vertices of Random Graphs

DOI10.1016/S0304-0208(08)73545-XMaRDI QIDQ3958505zbMATHOpenAlexFDO

Authors 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)

Cited in

(12)

• Local maxima of the systole function
• Improved random graph isomorphism
• Identifiability of graphs with small color classes by the Weisfeiler-Leman algorithm
• Canonization of a random circulant graph by counting walks
• Efficient random graph matching via degree profiles
• Isomorphism for random \(k\)-uniform hypergraphs
• Random quantum graphs
• Cutting planes width and the complexity of graph isomorphism refutations
• Exact matching of random graphs with constant correlation
• Distance degree regular graphs and distance degree injective graphs: an overview
• Robustly self-ordered graphs: constructions and applications to property testing
• Spectral graph matching and regularized quadratic relaxations. I: Algorithm and Gaussian analysis

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3958505)