A395234 - OEIS

%I #39 Jun 01 2026 09:17:36

%S 14,476075,364593585387

%N Number of cycles in K_{2n,2n,2n} minus a perfect matching.

%C Here cycles means simple cycles.

%C Regardless of which perfect matching is removed, the resulting graph is the same up to isomorphism.

%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/CompleteTripartiteGraphMinusPerfectMatching.html">Complete Tripartite Graph Minus Perfect Matching</a>.

%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/GraphCycle.html">Graph Cycle</a>.

%e a(1) = 14, since K_{2,2,2} minus a perfect matching is the 3-prism graph, which has 14 cycles.

%Y Cf. A393180 (perfect matchings in the same graph).

%Y Cf. A393586 (Hamiltonian cycles in the same graph).

%K nonn,more,bref

%O 1,1

%A _Eric W. Weisstein_, Jun 01 2026