We consider two types of random subgraphs of the n-cube. For these models we study the asymptotic behaviour of the number of vertices of degree d.
Asymptotic normality of subcubes in random subgraphs of the n-cube
โ Scribed by Urzula Konieczna
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 275 KB
- Volume
- 121
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
We consider two types of random subgraphs of the n-cube. For these models we study the asymptotic behaviour of the number of d-cubes when d = 1,2,
๐ SIMILAR VOLUMES
Let G(n, p ) denote the probability space consisting of all spanning subgraphs g of the n-cube En, and the probability is defined as ERDOS and SPENCER investigated the connectedness of such random graphs for fixed probability p , O<p<l (cf. [l]). I n this paper we study coverings of the vertex set
subgraphs as the graph of the It-dimensional cube Q,, (n 2 3), then IV(r)1 b t V(Q,,)j. Moreover, if IV'(f)\ = I VI CI,,)~, f is isomorphic to Q,,.
A random tournament T is obtained by independently orienting the edges of n 1 the complete graph on n vertices, with probability for each direction. We study the 2 asymptotic distribution, as n tends to infinity, of a suitable normalization of the number of subgraphs of T that are isomorphic to a gi