EUVIMEDEUVIMED entdecken
Crossref

The Maximum Number of Triangles in Graphs Without Cycles of Length 0mod5

Xiaojun Zhao, Yuejian Peng

Journal of Graph Theory · 05.08.2026

DOI: 10.1002/jgt.70111 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Graph Theory, online erschienen am 05.08.2026. Verfasst von Xiaojun Zhao und 1 weiteren Autor:innen. Die Arbeit nennt 53 Literaturangaben. Gefördert von: National Natural Science Foundation of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

For a graph and a graph family , let denote the maximum number of copies of in an ‐free ‐vertex graph. Let . Bai, Tompkins, and Well conjectured that is attained if and each block of the graph is a . In this paper, we determine the exact value of and the extremal graphs for all . The novelty of our proof is to give a proper partition of the set of triangles in an extremal graph. On the basis of this partition, we obtain the partition of the edge set and thus the structure of an extremal graph. Our new method can also be applied to obtain some meaningful results in other settings.

Förderung

  • National Natural Science Foundation of China

Zitieren

APA

Zhao, X., & Peng, Y. (2026). The Maximum Number of Triangles in Graphs Without Cycles of Length 0mod5. Journal of Graph Theory. https://doi.org/10.1002/jgt.70111

Vancouver

Zhao X, Peng Y. The Maximum Number of Triangles in Graphs Without Cycles of Length 0mod5. Journal of Graph Theory. 2026. doi:10.1002/jgt.70111

BibTeX
@article{Zhao2026,
  author = {Zhao, Xiaojun and Peng, Yuejian},
  title = {The Maximum Number of Triangles in Graphs Without Cycles of Length 0mod5},
  journal = {Journal of Graph Theory},
  year = {2026},
  doi = {10.1002/jgt.70111}
}
Kostenlos starten →