The following pages link to The infamous upper tail (Q4537625):
Displayed 17 items.
- Colorful triangle counting and a \textsc{MapReduce} implementation (Q413300) (← links)
- A fast algorithm for equitable coloring (Q532129) (← links)
- Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture (Q555496) (← links)
- Equitable colorings of Kronecker products of graphs (Q602760) (← links)
- Applications of Stein's method for concentration inequalities (Q606639) (← links)
- Equitable colorings of Cartesian products of graphs (Q765364) (← links)
- On equitable \(\Delta\)-coloring of graphs with low average degree (Q817775) (← links)
- \(t\)-wise independence with local dependencies (Q963369) (← links)
- Ore-type versions of Brooks' theorem (Q1003831) (← links)
- Concentration inequalities using the entropy method (Q1431503) (← links)
- Upper tails for subgraph counts in random graphs (Q1881736) (← links)
- Upper tails for counting objects in randomly induced subhypergraphs and rooted random graphs (Q2431088) (← links)
- An Ore-type theorem on equitable coloring (Q2464162) (← links)
- Equitable coloring of random graphs (Q3055766) (← links)
- Sub-Gaussian Tails for the Number of Triangles in<i>G</i>(<i>n, p</i>) (Q3068819) (← links)
- A concentration result with application to subgraph count (Q3119051) (← links)
- A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring (Q3512604) (← links)