Combinatorial aspects of the dimer problem

A $n$-dimensional problem of enumeration is formulated and solved exactly for one class of dimer configurations. Enumerated dimer configurations satisfy the standard restrictions of the dimer problem as well as the additional condition of the absence of any closed path in the corresponding graph representation. The equivalence of the problem considered to the standard dimer problem for two-dimensional lattice is established rigorously.