/explore
|
You are here 
|
yufeizhao.wordpress.com | ||
| | | | |
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, ... |
|
| | | | | ||
| | | | |
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 |
|
| | | | | ||
| | | | |
anuragbishnoi.wordpress.com
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... |
|
| | | | | ||
| | | | |
clutterreport.wordpress.com
attempting to clean up my living and workspace |
|
| | | |||
