On the Maximal Number of Strongly Independent Vertices in a Random Acyclic Directed Graph (Q3222867)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the Maximal Number of Strongly Independent Vertices in a Random Acyclic Directed Graph |
scientific article; zbMATH DE number 3889554
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Maximal Number of Strongly Independent Vertices in a Random Acyclic Directed Graph |
scientific article; zbMATH DE number 3889554 |
Statements
On the Maximal Number of Strongly Independent Vertices in a Random Acyclic Directed Graph (English)
0 references
1984
0 references
independent vertices
0 references
random digraph
0 references
0.9121895
0 references
0.8992596
0 references
0.89701337
0 references
0.8937365
0 references
0.89368683
0 references
0.8926045
0 references
0.8923492
0 references
0.8896494
0 references
