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		anuragbishnoi.wordpress.com Strong blocking sets and minimal codes from expander graphs \| Anurag's Math Blog
\|	\|	dominiczypen.wordpress.com Making critical graphs as regular as possible \| Musings on general topology and orderings	2.7 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$...	2.7 parsecs away Travel
\|	\|	lucatrevisan.wordpress.com CS294 Lecture 15: Abelian Cayley graphs \| in theory	2.1 parsecs away Travel
\|	\|	In which we show how to find the eigenvalues and eigenvectors of Cayley graphs of Abelian groups, we find tight examples for various results that we proved in earlier lectures, and, along the way, we develop the general theory of harmonic analysis which includes the Fourier transform of periodic functions of a real variable, the...	2.1 parsecs away Travel
\|	\|	terrytao.wordpress.com New Nikodym set constructions over finite fields \| What's new	2.5 parsecs away Travel
\|	\|	I have uploaded to the arXiv my paper "New Nikodym set constructions over finite fields". This is a spinoff of my previous project with Bogdan Georgiev, Javier Gómez-Serran...	2.5 parsecs away Travel
\|	\|	ploogmissingpieces.wordpress.com MikePloog: MissingPieces	17.1 parsecs away Travel
\|		Visit the post for more.	17.1 parsecs away Travel