Loading Events

« All Events

  • This event has passed.

Tianchi Yang, On the maximum number of edges in k-critical graphs

March 28 Tuesday @ 4:30 PM - 5:30 PM KST

Room B332, IBS (기초과학연구원)


Tianchi Yang
National University of Singapore

In this talk, we will discuss the problem of determining the maximum number of edges in an n-vertex k-critical graph. A graph is considered k-critical if its chromatic number is k, but any proper subgraph has a chromatic number less than k. The problem remains open for any integer k ≥ 4. Our presentation will showcase an improvement on previous results achieved by employing a combination of extremal graph theory and structural analysis. We will introduce a key lemma, which may be of independent interest, as it sheds light on the partial structure of dense k-critical graphs. This is joint work with Cong Luo and Jie Ma.


March 28 Tuesday
4:30 PM - 5:30 PM KST
Event Category:
Event Tags:


Room B332
IBS (기초과학연구원) + Google Map


Hong Liu
View Organizer Website
IBS 이산수학그룹 Discrete Mathematics Group
기초과학연구원 수리및계산과학연구단 이산수학그룹
대전 유성구 엑스포로 55 (우) 34126
IBS Discrete Mathematics Group (DIMAG)
Institute for Basic Science (IBS)
55 Expo-ro Yuseong-gu Daejeon 34126 South Korea
E-mail: dimag@ibs.re.kr, Fax: +82-42-878-9209
Copyright © IBS 2018. All rights reserved.