Universal limit theorems in graph coloring problems with connections to extremal combinatorics (Q525299): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1310.2336 / rank | |||
Normal rank | |||
Latest revision as of 14:49, 18 April 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
