On the random greedy \(F\)-free hypergraph process (Q322193)
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 6639355
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the random greedy \(F\)-free hypergraph process |
scientific article; zbMATH DE number 6639355 |
Statements
On the random greedy \(F\)-free hypergraph process (English)
0 references
14 October 2016
0 references
random greedy process
0 references
hypergraph
0 references
\(F\)-free process
0 references
1.0000005
0 references
0.88969517
0 references
0.8864937
0 references
0.88628167
0 references
0.8781512
0 references
0 references
