• This event has passed.

# Jun Gao, Number of (k-1)-cliques in k-critical graph

## August 30 Tuesday @ 4:30 PM - 5:30 PM KST

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

### Speaker

Jun Gao (高峻)
IBS Extremal Combinatorics and Probability Group

We prove that for $n>k\geq 3$, if $G$ is an $n$-vertex graph with chromatic number $k$ but any its proper subgraph has smaller chromatic number, then $G$ contains at most $n-k+3$ copies of cliques of size $k-1$. This answers a problem of Abbott and Zhou and provides a tight bound on a conjecture of Gallai.

This is joint work with Jie Ma.

## Details

Date:
August 30 Tuesday
Time:
4:30 PM - 5:30 PM KST
Event Category:
Event Tags:

Room B332

## Organizer

Sang-il Oum (엄상일)
View Organizer Website
기초과학연구원 수리및계산과학연구단 이산수학그룹
대전 유성구 엑스포로 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