Extremal even-cycle-free subgraphs of the complete transposition graphs

TL;DR

This paper establishes an asymptotic upper bound on the maximum number of edges in subgraphs of the complete transposition graph that do not contain even cycles of a given length, advancing understanding of extremal properties in Cayley graphs.

Contribution

It provides the first asymptotic upper bound for the extremal number of even cycles in the complete transposition graph, a key Cayley graph on the symmetric group.

Findings

Derived asymptotic upper bounds for ex(CT_n, C_{2l})

Extended extremal graph theory to Cayley graphs of symmetric groups

Enhanced understanding of cycle-free subgraph structures in algebraic graphs

Abstract

Given graphs $G$ and $H$, the generalized Tur\'{a}n number ${\rm ex}(G,H)$ is the maximum number of edges in an $H$-free subgraph of $G$. In this paper, we obtain an asymptotic upper bound on ${\rm ex}(CT_n,C_{2l})$ for any $n \ge 3$ and $l\geq2$, where $C_{2l}$ is the cycle of length $2l$ and $CT_n$ is the complete transposition graph which is defined as the Cayley graph on the symmetric group ${\rm S}_n$ with respect to the set of all transpositions of ${\rm S}_n$.