/explore
|
You are here 
|
yufeizhao.wordpress.com | ||
| | | | |
gowers.wordpress.com
|
|
| | | | | 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 | |
| | | | |
yufeizhao.com
|
|
| | | | | Resolution of Kahn's conjecture on the maximum number of independent sets in a graph with prescribed degree-degree distributions. | |
| | | | |
blog.computationalcomplexity.org
|
|
| | | | | (After I wrote this post Lance tweeted a pointer to a great talk by Ronald de Wolf with more examples, and also examples of quantum proofs, ... | |
| | | | |
kristalcantwell.wordpress.com
|
|
| | | Mini-polymath 4 has started. It is based on question 3 of the IMO. The research thread is here. There is a wiki here. | ||
