Universal limit theorems in graph coloring problems with connections to extremal combinatorics

DOI10.1214/16-AAP1205zbMath1360.05051arXiv1310.2336MaRDI QIDQ525299

Bhaswar B. Bhattacharya, Persi Diaconis, Sumit Mukherjee

Publication date: 3 May 2017

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.2336

zbMATH Keywords

graph coloringlimit theoremsextremal combinatoricscombinatorial probability

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15) Extremal combinatorics (05D99)

Related Items (11)

Motif estimation via subgraph sampling: the fourth-moment phenomenon ⋮ A fourth‐moment phenomenon for asymptotic normality of monochromatic subgraphs ⋮ Normal approximation and fourth moment theorems for monochromatic triangles ⋮ Multidimensional limit theorems for homogeneous sums: A survey and a general transfer principle ⋮ A limit theorem for small cliques in inhomogeneous random graphs ⋮ Fluctuations of subgraph counts in graphon based random graphs ⋮ Card guessing and the birthday problem for sampling without replacement ⋮ Asymptotic distribution of Bernoulli quadratic forms ⋮ Limit theorems for monochromatic stars ⋮ The Second-Moment Phenomenon for Monochromatic Subgraphs ⋮ Monochromatic subgraphs in randomly colored graphons

This page was built for publication: Universal limit theorems in graph coloring problems with connections to extremal combinatorics