On the asymmetry of random regular graphs and random graphs
From MaRDI portal
Publication:4798165
DOI10.1002/rsa.10054zbMath1012.05143OpenAlexW2012853908MaRDI QIDQ4798165
Jeong Han Kim, Van H. Vu, Benjamin Sudakov
Publication date: 19 March 2003
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.10054
Related Items (25)
The Threshold of Symmetry in Random Graphs with Specified Degree Sequences ⋮ Dirac's theorem for random graphs ⋮ Sandwiching random graphs: universality between random graph models ⋮ Pancyclic subgraphs of random graphs ⋮ Maximum Likelihood Estimation and Graph Matching in Errorfully Observed Networks ⋮ Random quantum graphs ⋮ New bounds for Ryser’s conjecture and related problems ⋮ The thresholds for diameter 2 in random Cayley graphs ⋮ A Case Study on Stochastic Games on Large Graphs in Mean Field and Sparse Regimes ⋮ Small subgraphs of random regular graphs ⋮ Aligning random graphs with a sub-tree similarity message-passing algorithm ⋮ On the exact maximum induced density of almost all graphs and their inducibility ⋮ The asymmetry number of finite tournaments, and some related results ⋮ The genus of curve, pants and flip graphs ⋮ ON THE STRUCTURE OF GRAPHS WHICH ARE LOCALLY INDISTINGUISHABLE FROM A LATTICE ⋮ Unnamed Item ⋮ Local resilience of graphs ⋮ Voting rules that are unbiased but not transitive-symmetric ⋮ On symmetry of uniform and preferential attachment graphs ⋮ Local Resilience and Hamiltonicity Maker–Breaker Games in Random Regular Graphs ⋮ Unnamed Item ⋮ Bandwidth theorem for random graphs ⋮ Approximate lumpability for Markovian agent-based models using local symmetries ⋮ Random regular graphs of non-constant degree: concentration of the chromatic number ⋮ Classical symmetries and the quantum approximate optimization algorithm
Cites Work
This page was built for publication: On the asymmetry of random regular graphs and random graphs
