/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

11011110.github.io
| | yufeizhao.com
6.0 parsecs away

Travel
| | Resolution of Kahn's conjecture on the maximum number of independent sets in a graph with prescribed degree-degree distributions.
| | dominiczypen.wordpress.com
5.5 parsecs away

Travel
| | Suppose you want to have a graph $latex G = (V,E)$ with chromatic number $latex \chi(G)$ equaling some value $latex k$, such that $latex G$ is minimal with this property. So you end up with a $latex k$-(vertex-)critical graph. It is easy to construct critical graphs by starting with some easy-to-verify example like $latex C_5$...
| | mathspp.com
5.6 parsecs away

Travel
| | This post goes over a well known riddle about measuring quantities.
| | craftofcoding.wordpress.com
21.8 parsecs away

Travel
| Programming Made Easy The basics of Programming The Basics of julia Coding in Fortran Coding in ada