A universal error bound in the CLT for counting monochromatic edges in uniformly colored graphs (Q2517246)
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: A universal error bound in the CLT for counting monochromatic edges in uniformly colored graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A universal error bound in the CLT for counting monochromatic edges in uniformly colored graphs |
scientific article |
Statements
A universal error bound in the CLT for counting monochromatic edges in uniformly colored graphs (English)
0 references
17 August 2015
0 references
Stein's method
0 references
normal approximation
0 references
rate of convergence
0 references
monochromatic edges
0 references
0.816186249256134
0 references
0.7781068682670593
0 references
0.7390391826629639
0 references
0.7212809324264526
0 references
