HackerTrans
トップ新着トレンドコメント過去質問紹介求人

dbranes

no profile record

コメント

dbranes
·8 年前·議論
Well that question only makes sense for connected graphs, we don't really know whether this is connected. So in general a version of this question that makes sense is, among all the connected components of the wikipedia graph, what is the largest diameter.
dbranes
·9 年前·議論
Unfortunately it's failing on first things I tried with a not-so-helpful error message:

https://www.arxiv-vanity.com/papers/1608.04012/

https://www.arxiv-vanity.com/papers/0903.3065/

Also a lot of MathJax failures (maybe Latex variables names?) https://www.arxiv-vanity.com/papers/1709.09439/
dbranes
·9 年前·議論
This is great. It's essentially asking you to work in a 2-category[1], which, once you get used to it, is an amazingly intuitive way to make sense of constructions in ordinary 1-categories.

[1]https://ncatlab.org/nlab/show/2-category