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

Mengyu Cao, Benjian Lv, Kaishun Wang and Sanming Zhou

Applied Mathematics and Computation, 2021, vol. 405, issue C

Abstract: 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.

Keywords: Turán number; Even-cycle-free subgraph; Complete transposition graph; Ramsey-type problem (search for similar items in EconPapers)
Date: 2021
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300321003131
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:405:y:2021:i:c:s0096300321003131

DOI: 10.1016/j.amc.2021.126223

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().