Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Seonghyuk Im"'
Publikováno v:
Forum of Mathematics, Sigma, Vol 12 (2024)
Hypertrees are linear hypergraphs where every two vertices are connected by a unique path. Elliott and Rödl conjectured that for any given $\mu>0$ , there exists $n_0$ such that the following holds. Every n-vertex Steiner triple system contains
Externí odkaz:
https://doaj.org/article/ace96dcc3672478ba4b38dcfef2ec97a
A proper coloring of a graph is \emph{proper conflict-free} if every non-isolated vertex $v$ has a neighbor whose color is unique in the neighborhood of $v$. A proper coloring of a graph is \emph{odd} if for every non-isolated vertex $v$, there is a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e5be4054d453bc8699e4211425da6dcc
http://arxiv.org/abs/2208.08330
http://arxiv.org/abs/2208.08330
Publikováno v:
European Journal of Combinatorics. 51:227-235
We study a relation between Ollivier's Ricci curvature and the mean square displacement of a random walk on a graph. Also we obtain explicit formulas for the mean square displacement of random walks on regular polyhedra.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a0497278993d9e54e84e94937cbd3ab0
https://doi.org/10.1016/j.ejc.2015.05.009
https://doi.org/10.1016/j.ejc.2015.05.009