EUVIMEDEUVIMED entdecken
Crossref

An Extension of Moon‐Moser Theorem Involving Bounded Matching Number

Guorong Gao, Jianfeng Hou, Hongbin Zhao

Journal of Graph Theory · 04.07.2026

DOI: 10.1002/jgt.70093 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Graph Theory, online erschienen am 04.07.2026. Verfasst von Guorong Gao und 2 weiteren Autor:innen. Die Arbeit nennt 23 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Natural Science Foundation of Fujian Province.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The classical Moon‐Moser Theorem gives a tight upper bound on the number of maximal cliques of graphs and characterizations of its extremal construction. In this paper, inspired by a recent work of Alon and Frankl on the Turán problem with bounded matching number, we extend it by giving a tight upper bound on the number of maximal cliques of an ‐vertex graph with matching number at most . Interestingly, the extremal construction depends on the choice of and . We also prove that the number of maximal independent sets of is at most , which is surprising that this value is independent of .

Förderung

  • National Natural Science Foundation of China
  • Natural Science Foundation of Fujian Province

Zitieren

APA

Gao, G., Hou, J., & Zhao, H. (2026). An Extension of Moon‐Moser Theorem Involving Bounded Matching Number. Journal of Graph Theory. https://doi.org/10.1002/jgt.70093

Vancouver

Gao G, Hou J, Zhao H. An Extension of Moon‐Moser Theorem Involving Bounded Matching Number. Journal of Graph Theory. 2026. doi:10.1002/jgt.70093

BibTeX
@article{Gao2026,
  author = {Gao, Guorong and Hou, Jianfeng and Zhao, Hongbin},
  title = {An Extension of Moon‐Moser Theorem Involving Bounded Matching Number},
  journal = {Journal of Graph Theory},
  year = {2026},
  doi = {10.1002/jgt.70093}
}
Kostenlos starten →