Maximum density of vertex-induced perfect cycles and paths in the hypercube

Abstract Let H and K be subsets of the vertex set V ( Q d ) of the d-cube Q d (we call H and K configurations in Q d ). We say K is an exact copy of H if there is an automorphism of Q d which sends H to K. If d is a positive integer and H is a configuration in Q d , we define λ ( H , d ) to be the limit as n goes to infinity of the maximum fraction, over all subsets S of V ( Q n ) , of sub-d-cubes of Q n whose intersection with S is an exact copy of H. We determine λ ( C 8 , 4 ) and λ ( P 4 , 3 ) where C 8 is a “perfect” 8-cycle in Q 4 and P 4 is a “perfect” path with 4 vertices in Q 3 , and make conjectures about λ ( C 2 d , d ) and λ ( P d + 1 , d ) for larger values of d. In our proofs there are connections with counting the number of sequences with certain properties and with the inducibility of certain small graphs. In particular, we needed to determine the inducibility of two vertex disjoint edges in the family of bipartite graphs.