Pages that link to "Item:Q525299"

The following pages link to Universal limit theorems in graph coloring problems with connections to extremal combinatorics (Q525299):

Displaying 11 items.

• Motif estimation via subgraph sampling: the fourth-moment phenomenon (Q2131263) (← links)
• Asymptotic distribution of Bernoulli quadratic forms (Q2240860) (← links)
• Monochromatic subgraphs in randomly colored graphons (Q2323107) (← links)
• Multidimensional limit theorems for homogeneous sums: A survey and a general transfer principle (Q2954236) (← links)
• Limit theorems for monochromatic stars (Q5216179) (← links)
• The Second-Moment Phenomenon for Monochromatic Subgraphs (Q5220473) (← links)
• A fourth‐moment phenomenon for asymptotic normality of monochromatic subgraphs (Q6063347) (← links)
• Normal approximation and fourth moment theorems for monochromatic triangles (Q6074673) (← links)
• A limit theorem for small cliques in inhomogeneous random graphs (Q6080866) (← links)
• Fluctuations of subgraph counts in graphon based random graphs (Q6091052) (← links)
• Card guessing and the birthday problem for sampling without replacement (Q6180369) (← links)