2019-1 IBS Workshop on Graph Theory

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

Invited Speakers Jeong Han Kim (김정한), KIAS, Seoul Martin Balko, Charles University, Prague Dániel Gerbner, Alfréd Rényi Institute of Mathematics, Budapest Cory T. Palmer, University of Montana, Missoula Boram Park (박보람), Ajou University Dong Yeap Kang (강동엽), KAIST Schedule Feb. 11, 2019, Monday 1:30pm-2:20pm Jeong Han Kim: Entropy and sorting 2:20pm-3:10pm Cory T. Palmer: Generalized Turán

Dong Yeap Kang (강동엽), Fragile minor-monotone parameters under random edge perturbation

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

We investigate how minor-monotone graph parameters change if we add a few random edges to a connected graph $H$. Surprisingly, after adding a few random edges, its treewidth, treedepth, genus, and the size of a largest complete minor become very large regardless of the shape of $H$. Our results are close to best possible for

Dong Yeap Kang (강동엽), A proof of the Erdős-Faber-Lovász conjecture

Zoom ID: 869 4632 6610 (ibsdimag)

A hypergraph is linear if every pair of two distinct edges shares at most one vertex. A longstanding conjecture by Erdős, Faber, and Lovász in 1972, states that the chromatic index of any linear hypergraph on $n$ vertices is at most $n$. In this talk, I will present the ideas to prove the conjecture for

Extremal and Probabilistic Combinatorics (2021 KMS Spring Meeting)

A special session "Extremal and Probabilistic Combinatorics" at the 2021 KMS Spring Meeting is organized by Tuan Tran. URL: https://www.kms.or.kr/meetings/spring2021/ Speakers and Schedule All talks are on April 30. Joonkyung Lee (이준경), University College London Majority dynamics on sparse random graphs Dong Yeap Kang (강동엽), Unversity of Birmingham The Erdős-Faber-Lovász conjecture and related results  Jinyoung

Dong Yeap Kang (강동엽), Hamilton cycles and optimal matchings in a random subgraph of uniform Dirac hypergraphs

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

A loose cycle is a cyclic ordering of edges such that every two consecutive edges share exactly one vertex. A cycle is Hamilton if it spans all vertices. A codegree of a $k$-uniform hypergraph is the minimum nonnegative integer $t$ such that every subset of vertices of size $k-1$ is contained in $t$ distinct edges.

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.