Skip to main content

All Questions

Filter by
Sorted by
Tagged with
3 votes
1 answer
234 views

Counting cycle vertex covers on hypercube

Let $Q_n$ be the $n$-dimensional hypercube graph. How many vertex cycle covers exist on $Q_n$? (Presumably the best we can hope for are upper and lower bounds.) To be clear, a single "vertex cycle ...
Bill Bradley's user avatar
  • 3,979
4 votes
2 answers
349 views

Can we find 3 disjoint directed Hamiltonian cycles in the cube?

Let $D$ be the digraph on $2^d$ vertices with $d2^d$ edges that we obtain by directing each edge of the $d$-dimensional hypercube in both directions. Can we partition the edges of $D$ into $d$ ...
domotorp's user avatar
  • 19.1k