Universal limit theorems in graph coloring problems with connections to extremal combinatorics (Q525299)
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: Universal limit theorems in graph coloring problems with connections to extremal combinatorics |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Universal limit theorems in graph coloring problems with connections to extremal combinatorics |
scientific article |
Statements
Universal limit theorems in graph coloring problems with connections to extremal combinatorics (English)
0 references
3 May 2017
0 references
combinatorial probability
0 references
extremal combinatorics
0 references
graph coloring
0 references
limit theorems
0 references
0.91469765
0 references
0.9050019
0 references
0.90168226
0 references
0.89944524
0 references
0 references
0.8916333
0 references
0.8898538
0 references
0.88935137
0 references
