/explore
|
You are here 
|
yufeizhao.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$. | |
| | | | |
symomega.wordpress.com
|
|
| | | | | I've just returned to Perth after giving one of the plenary talks at the "10th Slovenian Conference on Graph Theory" held in small ski-resort town of Kranjska Gora. I had never been to Slovenia before and hadn't realised how spectacularly beautiful it is. Lush green forests, steep mountains and azure alpine lakes complemented with a... | |
| | | | |
11011110.github.io
|
|
| | | | | Another new preprint of mine recently appeared: "Bandwidth vs BFS width in matrix reordering, graph reconstruction, and graph drawing", arXiv:2505.10789, wit... | |
| | | | |
windowsontheory.org
|
|
| | | The theoretical computer science community and science at large suffered a great tragedy today. Luca Trevisan has been one of my intellectual and personal heroes since I joined the field. His work on pseudorandomness, complexity, cryptography and algorithms has been a strong influence on my work. Whenever I wanted to understand a new topic, often... | ||
