Outer Web | Explore

Explore >> Select a destination

You are here		yufeizhao.wordpress.com Upper tails for triangles in sparse random graphs \| Yufei Zhao
\|	\|	yufeizhao.com Gunby: Upper tails for random regular graphs	0.8 parsecs away Travel
\|	\|	Ben Gunby's new paper determining the large deviation rate for sparse random regular graphs.	0.8 parsecs away Travel
\|	\|	jeremykun.wordpress.com Ramsey Number Lower Bound - Math ? Programming	3.0 parsecs away Travel
\|	\|	Define the Ramsey number $ R(k,m)$ to be the minimum number $ n$ of vertices required of the complete graph $ K_n$ so that for any two-coloring (red, blue) of the edges of $ K_n$ one of two things will happen: There is a red $ k$-clique; that is, a complete subgraph of $ k$...	3.0 parsecs away Travel
\|	\|	gowers.wordpress.com Entropy and Sidorenkos conjecture after Szegedy \| Gowers's Weblog	3.3 parsecs away Travel
\|	\|	Here is a simple but important fact about bipartite graphs. Let $latex G$ be a bipartite graph with (finite) vertex sets $latex X$ and $latex Y$ and edge density $latex \alpha$ (meaning that the number of edges is $latex \alpha \|X\|\|Y\|$). Now choose $latex (x_1,x_2)$ uniformly at random from $latex X^2$ and $latex (y_1,y_2)$ uniformly	3.3 parsecs away Travel
\|	\|	vitalyobukhov.wordpress.com Raaiiyaararaiyora \| #about.me	17.3 parsecs away Travel
\|		Visit the post for more.	17.3 parsecs away Travel