Explore >> Select a destination


You are here

austinrochford.com
| | www.ethanepperly.com
21.8 parsecs away

Travel
| |
| | joellaity.com
15.7 parsecs away

Travel
| | The code used to generate the plots for this post can be found here.
| | www.raynergobran.com
15.6 parsecs away

Travel
| | To better understand covariance, I take a short trip down the rabbit hole to visit eigen vectors and return carrying a covariance ellipse!
| | dominiczypen.wordpress.com
78.4 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$...