/explore
|
You are here 
|
yufeizhao.wordpress.com | ||
| | | | |
algorithmsoup.wordpress.com
In this post, I want to tell you about what I think might be the world's simplest interesting algorithm. The vertex cover problem. Given a graph $latex {G = (V, E)}&fg=000000$, we want to find the smallest set of vertices $latex {S \subseteq V}&fg=000000$ such that every edge $latex {e \in E}&fg=000000$ is covered by... |
|
| | | | | ||
| | | | |
jeremykun.wordpress.com
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$... |
|
| | | | | ||
| | | | |
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... |
|
| | | | | ||
| | | | |
djalil.chafai.net
The logarithmic potential is a classical object of potential theory intimately connected with the two dimensional Laplacian. It appears also in free probability theory via the free entropy, and in partial differential equations e.g. Patlak-Keller-Segel models. This post concerns only it usage for the spectra of non Hermitian random matrices. Let \( {\mathcal{P}(\mathbb{C})} \) be the set of probability measures... |
|
| | | |||
