Isomorphisms between random graphs

DOI10.1016/j.jctb.2023.01.001OpenAlexW3189350985MaRDI QIDQ2692783

Sourav Chatterjee, Persi Diaconis

Publication date: 23 March 2023

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2108.04323

zbMATH Keywords

random graphconcentration inequalitygraph isomorphism

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotically optimal induced universal graphs
• Subgraph isomorphism, matching relational structures and maximal cliques
• Self-Similarity of Graphs
• Complexity and randomness in the Heisenberg groups (and beyond)
• Cliques in random graphs
• When Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases
• Non-concentration of the chromatic number of a random graph
• The random graph

This page was built for publication: Isomorphisms between random graphs