Outer Web | Explore

/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 A binary model of cycle 3-coloring
\|	\|	dominiczypen.wordpress.com Making critical graphs as regular as possible \| Musings on general topology and orderings	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$...	5.5 parsecs away Travel
\|	\|	jeremykun.wordpress.com Ramsey Number Lower Bound - Math Programming	6.8 parsecs away Travel
\|	\|	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$...	6.8 parsecs away Travel
\|	\|	yufeizhao.com The number of independent sets in an irregular graph	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.	6.0 parsecs away Travel
\|	\|	cardinalguzman.wordpress.com P7090541 \| Cardinal Guzman	11.9 parsecs away Travel
\|		Encyclopedia Miscellaneous - 'quality' blogging since August 2011	11.9 parsecs away Travel