Given an (undirected) graph G = V; E; a clique of G is a subset of vertices in which every pair is connected by an edge. The problem of finding a clique of maximum size is a class...
Abstract. In this we paper we consider the version of the classical Towers of Hanoi games where the game-board contains more than three pegs. For k pegs we give a 2Ckn1/(k−2) low...