Connectivity threshold for random subgraphs of the Hamming graph (Q287817): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C40 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 60K35 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 82B43 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6583860 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
connectivity threshold | |||
| Property / zbMATH Keywords: connectivity threshold / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
percolation | |||
| Property / zbMATH Keywords: percolation / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
random graph | |||
| Property / zbMATH Keywords: random graph / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
critical window | |||
| Property / zbMATH Keywords: critical window / rank | |||
Normal rank | |||
Revision as of 19:03, 27 June 2023
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
