Independence numbers of random subgraphs of distance graphs (Q325669)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6640393
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Independence numbers of random subgraphs of distance graphs |
scientific article; zbMATH DE number 6640393 |
Statements
Independence numbers of random subgraphs of distance graphs (English)
0 references
18 October 2016
0 references
distance graph
0 references
random subgraph
0 references
independence number
0 references
Erdős-Ko-Rado problem
0 references
Erdős-Rényi model
0 references
0 references
0.91695237159729
0 references
0.9094451665878296
0 references
0.894588053226471
0 references
0.8758893609046936
0 references
0.8501828908920288
0 references
