Universal limit theorems in graph coloring problems with connections to extremal combinatorics (Q525299): Difference between revisions
From MaRDI portal
Removed claims |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 00:32, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
