Random graphs with forbidden vertex degrees

DOI10.1002/rsa.20307zbMath1209.05224arXiv0712.0270OpenAlexW2950383535MaRDI QIDQ3055889

Svante Janson, Geoffrey R. Grimmett

Publication date: 10 November 2010

Published in: Random Structures and Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

random graphrandom-cluster modeleven graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Vertex degrees (05C07)

Related Items

The constrained-degree percolation model, A new approach to the giant component problem, Weakly constrained-degree percolation on the hypercubic lattice, Constrained-degree percolation in random environment

Cites Work

• Unnamed Item
• The asymptotic distribution of short cycles in random regular graphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• The asymptotic number of labeled graphs with given degree sequences
• Logarithmic combinatorial structures: A probabilistic approach
• Sudden emergence of a giant \(k\)-core in a random graph
• A simple solution to the k‐core problem
• The Probability That a Random Multigraph is Simple
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• A critical point for random graphs with a given degree sequence
• The birth of the giant component
• Thek-Core and Branching Processes
• The Random-Cluster Model