-

Counting triangles in graphs without wheels on at least five vertices

组织者

白淑亮

演讲者

彭兴

时间

2026年08月22日 09:00 至 10:00

地点

A3-4-301

线上

Zoom 518 868 7656 (BIMSA)

摘要

For each integer k>=4, We consider a general problem which asks to determine the maximum number of triangles in graphs without wheels on at least k vertices. The case of k=4 was raised by Gallai. In this talk, I will introduce our result for the case of k=5 and discuss further research directions.