• This event has passed.

# Minki Kim (김민기), Rainbow paths and rainbow matchings

## February 23 Tuesday @ 4:30 PM - 5:30 PM KST

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

### Speaker

We prove that if $n \geq 3$, then any family of $3n-3$ sets of matchings of size $n$ in any graph has a rainbow matching of size $n$. This improves on a previous result, in which $3n-3$ is replaced by $3n-2$. We also prove a “cooperative” generalization: for $t > 0$ and $n \geq 3$, any $3n-4+t$ sets of edges, the union of every $t$ of which contains a matching of size $n$, have rainbow matching of size $n$. This is joint work with Ron Aharoni, Joseph Briggs, and Jinha Kim.

## Details

Date:
February 23 Tuesday
Time:
4:30 PM - 5:30 PM KST
Event Category:
Event Tags:
,

Room B232
IBS (기초과학연구원)

## Organizer

Sang-il Oum (엄상일)
Website:
https://dimag.ibs.re.kr/home/sangil/
기초과학연구원 수리및계산과학연구단 이산수학그룹
대전 유성구 엑스포로 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