Limit theorems for monochromatic stars

DOI10.1002/rsa.20856zbMath1439.05079arXiv1704.04674OpenAlexW2963676958WikidataQ128036379 ScholiaQ128036379MaRDI QIDQ5216179

Sumit Mukherjee, Bhaswar B. Bhattacharya

Publication date: 14 February 2020

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

graph coloringlimit theoremscombinatorial probabilitymonochromatic subgraphsubgraph counts

Mathematics Subject Classification ID

Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15)

Related Items (max. 100)

A fourth‐moment phenomenon for asymptotic normality of monochromatic subgraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A non-uniform birthday problem with applications to discrete logarithms
• Universal limit theorems in graph coloring problems with connections to extremal combinatorics
• Twitter event networks and the superstar model
• Multivariate generalizations of the Wald-Wolfowitz and Smirnov two-sample tests
• The matching, birthday and the strong birthday problem: a contemporary review
• A symmetric function generalization of the chromatic polynomial of a graph
• Monochromatic subgraphs in randomly colored graphons
• Estimating and understanding exponential random graph models
• A universal error bound in the CLT for counting monochromatic edges in uniformly colored graphs

This page was built for publication: Limit theorems for monochromatic stars