EUVIMEDEUVIMED entdecken
Crossref

Turán numbers of cycles plus a general graph

Chunyang Dou, Fu-Tao Hu, Xing Peng

Discrete Applied Mathematics · 2026-07 · 388 · 11-19

DOI: 10.1016/j.dam.2026.02.051 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Discrete Applied Mathematics, 2026-07. Verfasst von Chunyang Dou und 2 weiteren Autor:innen. Die Arbeit nennt 19 Literaturangaben. Gefördert von: Anhui Provincial Department of Education.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

For a family of graphs $\cal F$, a graph $G$ is $\cal F$-free if it does not contain a member of $\cal F$ as a subgraph. The Tur\'an number $\textrm{ex}(n,{\cal F})$ is the maximum number of edges in an $n$-vertex graph which is $\cal F$-free. Let ${\cal C}_{\geq k}$ be the set of cycles with length at least $k$. In this paper, we investigate the Tur\'an number of $\{{\cal C}_{\geq k}, F\}$ for a general graph $F$. To be precise, we determine $\textrm{ex}(n, \{{\cal C}_{\geq k}, F\})$ apart from a constant additive term, where $F$ either is a 2-connected nonbipartite graph or is a 2-connected bipartite graph under some conditions. This is an extension of a previous result on the Tur\'an number of $\{{\cal C}_{\geq k}, K_r\}$ by the first author, Ning, and the third author.

Förderung

  • Anhui Provincial Department of Education

Zitieren

APA

Dou, C., Hu, F., & Peng, X. (2026). Turán numbers of cycles plus a general graph. Discrete Applied Mathematics, 388, 11-19. https://doi.org/10.1016/j.dam.2026.02.051

Vancouver

Dou C, Hu F, Peng X. Turán numbers of cycles plus a general graph. Discrete Applied Mathematics. 2026;388:11-19. doi:10.1016/j.dam.2026.02.051

BibTeX
@article{Dou2026,
  author = {Dou, Chunyang and Hu, Fu-Tao and Peng, Xing},
  title = {Turán numbers of cycles plus a general graph},
  journal = {Discrete Applied Mathematics},
  year = {2026},
  volume = {388},
  pages = {11--19},
  doi = {10.1016/j.dam.2026.02.051}
}
Kostenlos starten →