On Hamiltonian cycles as optimal p-cycles

Using Hamiltonian p-cycles, it can be shown that p-cycle design is able to reach the logical redundancy bound of 1/(d~-1) where d~ is the average node degree. We formulate two conditions on which the design is able to reach this bound if and only if Hamiltonian p-cycles are used.