Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Ondřej Mička"'
Publikováno v:
Journal of Combinatorial Theory, Series B. 160:163-205
The \emph{central levels problem} asserts that the subgraph of the $(2m+1)$-dimensional hypercube induced by all bitstrings with at least $m+1-\ell$ many 1s and at most $m+\ell$ many 1s, i.e., the vertices in the middle $2\ell$ levels, has a Hamilton
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1ed9df963ef731c218b69dd4f3c2f4f7
https://doi.org/10.1016/j.jctb.2022.12.008
https://doi.org/10.1016/j.jctb.2022.12.008
The well-known middle levels conjecture asserts that for every integer $n\geq 1$, all binary strings of length $2(n+1)$ with exactly $n+1$ many 0s and 1s can be ordered cyclically so that any two consecutive strings differ in swapping the first bit w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4488201846d5324c0d2772676c76ef1a
http://arxiv.org/abs/2007.07164
http://arxiv.org/abs/2007.07164
