2000 character limit reached
Induced subgraphs in sparse random graphs with given degree sequence
Published 16 Nov 2010 in math.CO | (1011.3810v2)
Abstract: For any $S\subset [n]$, we compute the probability that the subgraph of $\mathcal{G}{n,d}$ induced by $S$ is a given graph $H$ on the vertex set $S$. The result holds for any $d=o(n{1/3})$ and is further extended to $\mathcal{G}{{\bf d}}$, the probability space of random graphs with a given degree sequence $\bf d$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.