Outer Web | Explore

Explore >> Select a destination

You are here		dominiczypen.wordpress.com Making critical graphs as regular as possible \| Musings on general topology and orderings
\|	\|	cuoichutdi.wordpress.com Chân lý ?n d?u hay trùng h?p tình c?? \| Blog Toán H?c	5.2 parsecs away Travel
\|	\|	Liverpool v?a vô ??ch Premier League, ?i?u này t?o nên m?t th?ng kê thú v?: s? cúp vô ??ch c?a các ??i bóng t?o thành m?t dãy s? Fibonacci. ?i?u này là ng?u nhiên hay có m?t cách lí gi?i toán h?c ?n sau nó? Tôi biên bài báo ng?n v? dãy Fibonacci c?ng nh?...	5.2 parsecs away Travel
\|	\|	algorithmsoup.wordpress.com The World's Simplest Interesting Algorithm - Algorithm Soup	5.0 parsecs away Travel
\|	\|	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...	5.0 parsecs away Travel
\|	\|	kristalcantwell.wordpress.com Mini-polymath 4 \| Euclidean Ramsey Theory	5.9 parsecs away Travel
\|	\|	Mini-polymath 4 has started. It is based on question 3 of the IMO. The research thread is here. There is a wiki here.	5.9 parsecs away Travel
\|	\|	rapuran.wordpress.com Travel theme: Autumn - Realization	26.7 parsecs away Travel
\|		More on Weekly Travel Theme	26.7 parsecs away Travel