## June 2022

### Xizhi Liu, Hypergraph Turán problem: from 1 to ∞

Zoom ID: 870 0312 9412 (ibsecopro)

One interesting difference between (nondegenerate) Graph Turán problem and Hypergraph Turán problem is that the hypergraph families can have at least two very different extremal constructions. In this talk, we

## July 2022

### Sepehr Hajebi, Induced subgraphs and tree decompositions V. One neighbor in a hole

Zoom ID: 869 4632 6610 (ibsdimag)

A hole in a graph $G$ is an induced cycle of length at least four, and for every hole $H$ in $G$, a vertex $h\in G\setminus H$ is called a

### Noam Lifshitz, TBA

Zoom ID: 870 0312 9412 (ibsecopro)

## August 2022

### Lars Jaffke, Taming graphs with no large creatures and skinny ladders

Zoom ID: 869 4632 6610 (ibsdimag)

We confirm a conjecture of Gartland and Lokshtanov : if for a hereditary graph class $\mathcal{G}$ there exists a constant $k$ such that no member of $\mathcal{G}$ contains a $k$-creature

### Akash Kumar, Random walks and Forbidden Minors

Zoom ID: 870 0312 9412 (ibsecopro)

Random walks and spectral methods have had a strong influence on modern graph algorithms as evidenced by the extensive literature on the subject. In this talk, I will present how

## September 2022

### Dömötör Pálvölgyi, C-P3O: Orientation of convex sets and other good covers

Zoom ID: 870 0312 9412 (ibsecopro)

We introduce a novel definition of orientation on the triples of a family of pairwise intersecting planar convex sets and study its properties. In particular, we compare it to other

기초과학연구원 수리및계산과학연구단 이산수학그룹
대전 유성구 엑스포로 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