Monochromatic subgraphs in randomly colored graphons

DOI10.1016/j.ejc.2019.06.007zbMath1420.05051arXiv1707.05889OpenAlexW2963343769WikidataQ127567948 ScholiaQ127567948MaRDI QIDQ2323107

Bhaswar B. Bhattacharya, Sumit Mukherjee

Publication date: 30 August 2019

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

monochromatic \(s\)-cliquesuniformly random coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (6)

A fourth‐moment phenomenon for asymptotic normality of monochromatic subgraphs ⋮ Normal approximation and fourth moment theorems for monochromatic triangles ⋮ A limit theorem for small cliques in inhomogeneous random graphs ⋮ Fluctuations of subgraph counts in graphon based random graphs ⋮ Limit theorems for monochromatic stars ⋮ The Second-Moment Phenomenon for Monochromatic Subgraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A non-uniform birthday problem with applications to discrete logarithms
• Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
• Collision times in multicolor urn models and sequential graph coloring with applications to discrete logarithms
• Universal limit theorems in graph coloring problems with connections to extremal combinatorics
• The large deviation principle for the Erdős-Rényi random graph
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• Multivariate generalizations of the Wald-Wolfowitz and Smirnov two-sample tests
• Poisson approximation and the Chen-Stein method. With comments and a rejoinder by the authors
• The matching, birthday and the strong birthday problem: a contemporary review
• Universality of the mean-field for the Potts model
• Inference in Ising models
• Estimating and understanding exponential random graph models
• A universal error bound in the CLT for counting monochromatic edges in uniformly colored graphs
• Multicollision Attacks on Some Generalized Sequential Hash Functions
• Testing Closeness of Discrete Distributions

This page was built for publication: Monochromatic subgraphs in randomly colored graphons