Paul Seymour, Polynomial bounds for chromatic number

Zoom ID: 869 4632 6610 (ibsdimag)

The Gyárfás-Sumner conjecture says that for every forest $H$, there is a function $f$ such that the chromatic number $\chi(G)$ is at most $f(\omega(G))$ for every $H$-free graph $G$ ("$H$-free" means with

Ben Lund, Maximal 3-wise intersecting families

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

A family $\mathcal F$ of subsets of {1,2,…,n} is called maximal k-wise intersecting if every collection of at most k members from $\mathcal F$ has a common element, and moreover,

Casey Tompkins, Ramsey numbers of Boolean lattices

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

The poset Ramsey number $R(Q_{m},Q_{n})$ is the smallest integer $N$ such that any blue-red coloring of the elements of the Boolean lattice $Q_{N}$ has a blue induced copy of $Q_{m}$

Tuukka Korhonen, Fast FPT-Approximation of Branchwidth

Zoom ID: 869 4632 6610 (ibsdimag)

Branchwidth determines how graphs, and more generally, arbitrary connectivity (basically symmetric and submodular) functions could be decomposed into a tree-like structure by specific cuts. We develop a general framework for

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.