Perfect matchings in the semirandom graph process (Q5864217)
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 7537557
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Perfect matchings in the semirandom graph process |
scientific article; zbMATH DE number 7537557 |
Statements
Perfect Matchings in the Semirandom Graph Process (English)
0 references
3 June 2022
0 references
semirandom process
0 references
perfect matchings
0 references
random graphs
0 references
0 references
0 references
0.8355869054794312
0 references
0.805915117263794
0 references
0.7965251803398132
0 references
0.7893862724304199
0 references
0.7709328532218933
0 references
