Large induced subgraphs of random graphs with given degree sequences

DOI10.1002/RSA.21254MaRDI QIDQ7027486zbMATH OpenFDO

Authors Angus Southwell, Nicholas Wormald

Publication date 14 February 2025

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1002/RSA.21254

zbMATH Keywords

degree sequencegiant componentpercolationprobabilityrandom graphs

Mathematics Subject Classification ID

Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Random graphs (graph-theoretic aspects) (05C80) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Combinatorial probability (60C05)

Cites work

• A critical point for random graphs with a given degree sequence
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
• Extreme degree sequences of simple graphs
• How to determine if a random graph with a fixed degree sequence has a giant component
• scientific article; zbMATH DE number 3148802 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• On percolation in random graphs with given vertex degrees
• Percolation on random graphs with a fixed degree sequence
• Percolation on sparse random graphs with given degree sequence
• The component structure of dense random subgraphs of the hypercube

This page was built for publication: Large induced subgraphs of random graphs with given degree sequences

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