Extremal even-cycle-free subgraphs of the complete transposition graphs
Mengyu Cao, Benjian Lv, Kaishun Wang, Sanming Zhou
APPLIED MATHEMATICS AND COMPUTATION | ELSEVIER SCIENCE INC | Published : 2021
Given graphs G and H, the generalized Turán number 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 ex(CTn,C2ℓ) for any n≥3 and ℓ≥2, where C2ℓ is the cycle of length 2ℓ and CTn is the complete transposition graph which is defined as the Cayley graph on the symmetric group Sn with respect to the set of all transpositions of Sn.
Awarded by NSFC
Awarded by NSF of Hebei Province
Awarded by National Key R&D Program of China
B. Lv is supported by NSFC (12071039, 11671043) and NSF of Hebei Province(A2019205092), K. Wang is supported by the National Key R&D Program of China (No. 2020YFA0712900) and NSFC (12071039, 11671043).