Isomorphism and embedding problems for infinite limits of scale-free graphs

MaRDI QIDQ2921680zbMATH OpenFDO

Authors Robert D. Kleinberg, Jon M. Kleinberg

Publication date 13 October 2014

Mathematics Subject Classification ID

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

Recommendations

• Random graphs associated to some discrete and continuous time preferential attachment models
• Asymptotic behavior and distributional limits of preferential attachment graphs
• A preferential attachment process approaching the Rado graph
• Infinite limits and adjacency properties of a generalized copying model
• Infinite Limits of Copying Models of the Web Graph

Cited in

(16)

• On the dense preferential attachment graph models and their graphon induced counterpart
• Then-ordered graphs: A new graph class
• Subgraphs in preferential attachment models
• Preferential attachment processes approaching the Rado multigraph
• \(\gamma\)-variable first-order logic of uniform attachment random graphs
• MSO 0-1 law for recursive random trees
• Perfect matchings and Hamiltonian cycles in the preferential attachment model
• A preferential attachment process approaching the Rado graph
• Asymmetry and structural information in preferential attachment graphs
• Generating infinite random graphs
• Infinite Locally Random Graphs
• Infinite limits and adjacency properties of a generalized copying model
• Bounded expansion in web graphs.
• Infinite random geometric graphs
• Evolving Shelah‐Spencer graphs
• An explicit construction of \((3,t)\)-existentially closed graphs

This page was built for publication: Isomorphism and embedding problems for infinite limits of scale-free graphs

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