Hamiltonian threshold for strong products of graphs

Abstract

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.

Keywords

• Hamiltonian
• threshold
• strong
• products
• graphs