匹配数有界的图兰图

IF 1.2 1区数学 Q1 MATHEMATICS

Journal of Combinatorial Theory Series B Pub Date : 2023-12-15 DOI:10.1016/j.jctb.2023.12.002

Noga Alon , Péter Frankl

引用次数: 0

摘要

对于所有允许的参数值，我们确定了具有n个顶点的图的最大可能边数，匹配数最多为s，团数最多为k。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Turán graphs with bounded matching number

We determine the maximum possible number of edges of a graph with n vertices, matching number at most s and clique number at most k for all admissible values of the parameters.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Combinatorial Theory Series B 数学-数学

CiteScore

2.70

自引率

14.30%

发文量

审稿时长

6-12 weeks

期刊介绍： The Journal of Combinatorial Theory publishes original mathematical research dealing with theoretical and physical aspects of the study of finite and discrete structures in all branches of science. Series B is concerned primarily with graph theory and matroid theory and is a valuable tool for mathematicians and computer scientists.