A concentration inequality for maximum matching size in random graphs<sup>1</sup> (Q5750022)
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 4184493
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A concentration inequality for maximum matching size in random graphs<sup>1</sup> |
scientific article; zbMATH DE number 4184493 |
Statements
A concentration inequality for maximum matching size in random graphs<sup>1</sup> (English)
0 references
1990
0 references
maximum matching of a graph on n vertices
0 references
models of random graphs
0 references
Martingale inequalities
0 references
0.8291172385215759
0 references
0.7920161485671997
0 references
0.7802190184593201
0 references
