Connectivity threshold for random subgraphs of the Hamming graph (Q287817): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1504.05350 / rank | |||
Normal rank | |||
Latest revision as of 13:21, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Connectivity threshold for random subgraphs of the Hamming graph |
scientific article |
Statements
Connectivity threshold for random subgraphs of the Hamming graph (English)
0 references
23 May 2016
0 references
connectivity threshold
0 references
percolation
0 references
random graph
0 references
critical window
0 references
