Large cycles in generalized Johnson graphs

TL;DR

This paper investigates the enumeration of large cycles in generalized Johnson graphs, providing asymptotic formulas for the number of such cycles as their length grows under specific conditions.

Contribution

It introduces new asymptotic results for counting large cycles in generalized Johnson graphs, extending previous understanding of their cycle structure.

Findings

Asymptotic formulas for cycle counts are derived.

Cycle counts depend on the growth rate of cycle length.

Results apply to unbounded cycle lengths in these graphs.

Abstract

We count cycles of an unbounded length in generalized Johnson graphs. Asymptotics of the number of such cycles is obtained for certain growth rates of the cycle length.