Benjamin Bumpus, Directed branch-width: A directed analogue of tree-width

Zoom ID: 934 3222 0374 (ibsdimag)

Many problems that are NP-hard in general become tractable on `structurally recursive’ graph classes. For example, consider classes of bounded tree- or clique-width. Since the 1990s, many directed analogues of tree-width have been proposed. However, many natural problems (e.g. directed HamiltonPath and MaxCut) remain intractable on such digraph classes of `bounded width’. In this talk,

Dimitrios M. Thilikos, Bounding Obstructions sets: the cases of apices of minor closed classes

Zoom ID: 934 3222 0374 (ibsdimag)

Given a minor-closed graph class ${\cal G}$, the (minor) obstruction of ${\cal G}$ is the set of all minor-minimal graphs not in ${\cal G}$. Given a non-negative integer $k$, we define the $k$-apex of ${\cal A}$ as the class containing every graph $G$ with a set $S$ of vertices whose removal from $G$ gives a graph

Adam Zsolt Wagner, Constructions in combinatorics via neural networks

Zoom ID: 934 3222 0374 (ibsdimag)

Recently, significant progress has been made in the area of machine learning algorithms, and they have quickly become some of the most exciting tools in a scientist’s toolbox. In particular, recent advances in the field of reinforcement learning have led computers to reach superhuman level play in Atari games and Go, purely through self-play. In

Alan Lew, Representability and boxicity of simplicial complexes

Zoom ID: 934 3222 0374 (ibsdimag)

An interval graph is the intersection graph of a family of intervals in the real line. Motivated by problems in ecology, Roberts defined the boxicity of a graph G to be the minimal k such that G can be written as the intersection of k interval graphs. A natural higher-dimensional generalization of interval graphs is

Stefan Weltge, Integer programs with bounded subdeterminants and two nonzeros per row

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

We give a strongly polynomial-time algorithm for integer linear programs defined by integer coefficient matrices whose subdeterminants are bounded by a constant and that contain at most two nonzero entries in each row. The core of our approach is the first polynomial-time algorithm for the weighted stable set problem on graphs that do not contain

Maria Chudnovsky, Induced subgraphs and tree decompositions

Zoom ID: 934 3222 0374 (ibsdimag)

Tree decompositions are a powerful tool in structural graph theory; they are traditionally used in the context of forbidden graph minors. Connecting tree decompositions and forbidden induced subgraphs has until recently remained out of reach. Tree decompositions are closely related to the existence of "laminar collections of separations" in a graph, which roughly means that

Petr Hliněný, Twin-width is linear in the poset width

Zoom ID: 934 3222 0374 (ibsdimag)

Twin-width is a new parameter informally measuring how diverse are the neighbourhoods of the graph vertices, and it extends also to other binary relational structures, e.g. to digraphs and posets. It was introduced quite recently, in 2020 by Bonnet, Kim, Thomassé, and Watrigant. One of the core results of these authors is that FO model checking on graph classes of

Péter Pál Pach, The Alon-Jaeger-Tarsi conjecture via group ring identities

Zoom ID: 934 3222 0374 (ibsdimag)

The Alon-Jaeger-Tarsi conjecture states that for any finite field $\mathbb{F}$ of size at least 4 and any nonsingular matrix $M$ over $\mathbb{F}$ there exists a vector $x$ such that neither $x$ nor $Mx$ has a 0 component. In joint work with János Nagy we proved this conjecture when the size of the field is sufficiently

Paul Seymour, Polynomial bounds for chromatic number

Zoom ID: 934 3222 0374 (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 no induced subgraph isomorphic to $H$, and $\omega(G)$ is the size of the largest clique of $G$). This well-known conjecture has been proved only for a

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:, Fax: +82-42-878-9209
Copyright © IBS 2018. All rights reserved.