/explore
|
You are here 
|
junglyhh.wordpress.com | ||
| | | | |
www.jeremykun.com
|
|
| | | | | For fixed integers $ r > 0$, and odd $ g$, a Moore graph is an $ r$-regular graph of girth $ g$ which has the minimum number of vertices $ n$ among all such graphs with the same regularity and girth. (Recall, A the girth of a graph is the length of its shortest cycle, and it's regular if all its vertices have the same degree) Problem (Hoffman-Singleton): Find a useful constraint on the relationship between $ n$ and $ r$ for Moore graphs of girth $ 5$ and degree $ r$. | |
| | | | |
11011110.github.io
|
|
| | | | | After working on the Wikipedia Antimatroid article this weekend, I was excited to realize that my paper on maximum subtrees with chouyu_31 from SWAT'06 could... | |
| | | | |
thehighergeometer.wordpress.com
|
|
| | | | | Here's a fun thing: if you want to generate a random finite $latex T_0$ space, instead select a random subset from $latex \mathbb{S}^n$, the $latex n$-fold power of the Sierpinski space $latex \mathbb{S}$, since every $latex T_0$ space embeds into some (arbitrary) product of copies of the Sierpinski space. (Recall that $latex \mathbb{S}$ has underlying... | |
| | | | |
www.wired.com
|
|
| | | Two leading candidates are headed for mass clinical trials, and everything's on the table-including deliberately infecting healthy vaccine volunteers. | ||
