On even-cycle-free subgraphs of the doubled Johnson graphs

Mengyu Cao, Benjian Lv and Kaishun Wang

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

Abstract: The generalized Turán number ex(G,H) is the maximum number of edges in an H-free subgraph of a graph G. It is an important extension of the classical Turán number ex(n,H), which is the maximum number of edges in a graph with n vertices that does not contain H as a subgraph. In this paper, we consider the maximum number of edges in an even-cycle-free subgraph of the doubled Johnson graphs J(n;k,k+1), which are bipartite subgraphs of hypercube graphs. We give an upper bound for ex(J(n;k,k+1),C2r) with any fixed k∈Z+ and any n∈Z+ with n≥2k+1. We also give an upper bound for ex(J(2k+1;k,k+1),C2r) with any k∈Z+, where J(2k+1;k,k+1) is known as doubled Odd graph O˜k+1. This bound induces that the number of edges in any C2r-free subgraph of O˜k+1 is o(e(O˜k+1)) for r≥6, which also implies a Ramsey-type result.

Keywords: Turán number; Even-cycle-free subgraph; Doubled Johnson graph; Doubled odd 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/S0096300320307165
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:403:y:2021:i:c:s0096300320307165

DOI: 10.1016/j.amc.2020.125763

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 ().