EUVIMEDEUVIMED entdecken
Crossref

Further results on the number of cliques in graphs covered by long cycles

Yanan Hu, Leilei Zhang

Discrete Mathematics · 2027-02 · 350 (2) · 115436

DOI: 10.1016/j.disc.2026.115436 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Discrete Mathematics, 2027-02. Verfasst von Yanan Hu und 1 weiteren Autor:innen. Die Arbeit nennt 14 Literaturangaben. Gefördert von: Fundamental Research Funds for the Central Universities, National Natural Science Foundation of China, Science and Technology Commission of Shanghai Municipality.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Let $\Gamma(n,k)$ be the set of $2$-connected $n$-vertex graphs containing an edge that is not on any cycle of length at least $k+1.$ Let $g_s(n,k)$ denote the maximum number of $s$-cliques in a graph in $\Gamma(n,k).$ Recently, Ji and Ye [SIAM J. Discrete Math., 37 (2023) 917-924] determined $g_s(n,k).$ They remark that it is interesting to characterize the extremal graphs. In this paper, we give such a characterization.

Förderung

  • Fundamental Research Funds for the Central Universities
  • National Natural Science Foundation of China
  • Science and Technology Commission of Shanghai Municipality
  • China Postdoctoral Science Foundation
  • Japan Society for the Promotion of Science
  • Natural Science Foundation of Hubei Province

Zitieren

APA

Hu, Y., & Zhang, L. (2027). Further results on the number of cliques in graphs covered by long cycles. Discrete Mathematics, 350(2), 115436. https://doi.org/10.1016/j.disc.2026.115436

Vancouver

Hu Y, Zhang L. Further results on the number of cliques in graphs covered by long cycles. Discrete Mathematics. 2027;350(2):115436. doi:10.1016/j.disc.2026.115436

BibTeX
@article{Hu2027,
  author = {Hu, Yanan and Zhang, Leilei},
  title = {Further results on the number of cliques in graphs covered by long cycles},
  journal = {Discrete Mathematics},
  year = {2027},
  volume = {350},
  number = {2},
  pages = {115436},
  doi = {10.1016/j.disc.2026.115436}
}
Kostenlos starten →