Embedding theorems for random graphs with specified degrees

DOI10.1017/S0963548324000300MaRDI QIDQ6880011zbMATH OpenFDO

Authors Pu Gao

Publication date 29 December 2025

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

embeddingcouplingChung-Lu modelgeneralized Erdős-Renyi graphsKim-Vu's sandwich conjecturenon-regular degree sequence

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3906527 (Why is no real title available?)
• scientific article; zbMATH DE number 1342092 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Asymptotic enumeration by degree sequence of graphs of high degree
• Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
• Complex martingales and asymptotic enumeration
• Connected components in random graphs with given expected degree sequences
• Distribution of subgraphs of random regular graphs
• Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity
• Enumeration of graphs with a heavy-tailed degree sequence
• Hamiltonicity of random graphs in the stochastic block model
• On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries
• Random Graphs and Complex Networks
• Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity
• Random graphs with a given degree sequence
• Random regular graphs of high degree
• SIR epidemics on random graphs with a fixed degree sequence
• Sandwiching biregular random graphs
• Sandwiching dense random regular graphs between binomial random graphs
• Sandwiching random graphs: universality between random graph models
• Sandwiching random regular graphs between binomial random graphs
• Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity
• The Spectra of Random Graphs with Given Expected Degrees
• The Volume of the Giant Component of a Random Graph with Given Expected Degrees
• The asymptotic number of labeled graphs with given degree sequences
• The average distances in random graphs with given expected degrees
• The number of graphs and a random graph with a given degree sequence
• The order of the largest complete minor in a random graph
• Thresholds versus fractional expectation-thresholds

This page was built for publication: Embedding theorems for random graphs with specified degrees

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