Extremal function of two independent chorded cycles in a bipartite graph

Panpan Cheng and Yunshu Gao

Applied Mathematics and Computation, 2025, vol. 493, issue C

Abstract: Let G be a bipartite graph. In this paper, by constructing two extremal graphs, we completely determine the minimum number of edges of G that guaranteeing the existence of two independent chorded cycles. As a byproduct, our result also implies that G contains two independent cycles of different lengths.

Keywords: Bipartite graph; Cycles with different lengths; Extremal problems (search for similar items in EconPapers)
Date: 2025
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300324007148
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:493:y:2025:i:c:s0096300324007148

DOI: 10.1016/j.amc.2024.129253

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