The maximum number of triangles in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e97" altimg="si12.svg"><mml:msub><mml:mrow><mml:mi>F</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:math>-free graphs-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

The maximum number of triangles in Fk-free graphs

Published:2023-12 Issue: Volume:114 Page:103793
ISSN:0195-6698
Container-title:European Journal of Combinatorics
language:en
Short-container-title:European Journal of Combinatorics

Author:

Zhu Xiutao,Chen Yaojun,Gerbner Dániel,Győri Ervin,Karim Hilal Hama

Funder

National Research, Development and Innovation Office

National Natural Science Foundation of China

NKFIH

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics

Reference25 articles.

1. Many T copies in H-free graphs;Alon;J. Combin. Theory Ser. B,2016

2. Sur le couplage maximum d’un graphe;Berge;C. R. Math. Acad. Sci. Paris,1958

3. Pentagons vs. triangles;Bollobás;Discrete Math.,2008

4. The maximum number of triangles in a graph of given maximum degree;Chase;Adv. Comput.,2020

5. Unavoidable stars in 3-graph;Chung;J. Combin. Theory Ser. A,1983

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Generalized Turán results for edge blow-up of star forests;Discrete Mathematics;2024-11

2. Counting triangles in graphs without vertex disjoint odd cycles;Discrete Mathematics;2024-07

3. The generalized Turán problem of two intersecting cliques;Discussiones Mathematicae Graph Theory;2024

4. Some Exact Results for Non-Degenerate Generalized Turán Problems;The Electronic Journal of Combinatorics;2023-12-15

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP