Outer Web | Explore

/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.

You are here		yufeizhao.wordpress.com Extremal regular graphs \| Yufei Zhao
\|	\|	yufeizhao.com The number of independent sets in an irregular graph	1.3 parsecs away Travel
\|	\|	Resolution of Kahn's conjecture on the maximum number of independent sets in a graph with prescribed degree-degree distributions.	1.3 parsecs away Travel
\|	\|	gowers.wordpress.com Entropy and Sidorenkos conjecture after Szegedy \| Gowers's Weblog	2.1 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	2.1 parsecs away Travel
\|	\|	anuragbishnoi.wordpress.com The Rank-Ramsey problem \| Anurag's Math Blog	2.8 parsecs away Travel
\|	\|	The Ramsey number $latex R(s, t)$ is the smallest $latex n$ such that every graph on $latex \geq n$ vertices either contains a clique of size $latex s$ or an independent set of size $latex t$. Ramsey's theorem implies that these numbers always exist, and determining them (precisely or asymptotically) has been a major challenge...	2.8 parsecs away Travel
\|	\|	ropmann.wordpress.com Clover \| Roland's Photo Blog	42.8 parsecs away Travel
\|		Visit the post for more.	42.8 parsecs away Travel