• This event has passed.
Livestream

# Joonkyung Lee (이준경), On common graphs

## Wednesday, December 2, 2020 @ 5:00 PM - 6:00 PM KST

Zoom ID:8628398170 (123450)

### Speaker

A graph $H$ is common if the number of monochromatic copies of $H$ in a 2-edge-colouring of the complete graph $K_n$ is minimised by the random colouring. Burr and Rosta, extending a famous conjecture by Erdős, conjectured that every graph is common. The conjectures by Erdős and by Burr and Rosta were disproved by Thomason and by Sidorenko, respectively, in the late 1980s.

Despite its importance, the full classification of common graphs is still a wide open problem and has not seen much progress since the early 1990s. In this lecture, I will present some old and new techniques to prove whether a graph is common or not.

## Details

Date:
Wednesday, December 2, 2020
Time:
5:00 PM - 6:00 PM KST
Event Category:
Event Tags:
,

## Venue

Zoom ID:8628398170 (123450)

## Organizer

Jaehoon Kim (김재훈)
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