Nalezneme asymptoticky optimální dolní odhad na počet grafů s omezených maximálním stupněm, který garantuje, že jejich silný součin bude hamiltonovský. (cs)
We prove an assymptotical optimal lower bound on the number of graphs with bounded maximum degree in a strong product to guarantee that the resulting graph is hamiltonian.
We prove an assymptotical optimal lower bound on the number of graphs with bounded maximum degree in a strong product to guarantee that the resulting graph is hamiltonian. (en)