Sophie Spirkl, Pure pairs in ordered graphs

Zoom ID: 869 4632 6610 (ibsdimag)

A pure pair in a graph G is a pair of subsets A, B of the vertex set of G such that in G, either all of the edges or none of the edges between A and B are present. Pure pairs have been studied recently motivated by their connections to the Erdos-Hajnal conjecture. In

Michał Pilipczuk, Structural properties of powers of sparse graphs

Zoom ID: 869 4632 6610 (ibsdimag)

For a graph G and an integer d, the dth power of G is the graph $G^d$ on the same vertex set as G where two vertices are considered adjacent if and only if they are at distance at most d in G. Assuming that G is sparse, what can we say about the structure

William Overman, Some Ordered Ramsey Numbers of Graphs on Four Vertices

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

Ordered Ramsey numbers were introduced in 2014 by Conlon, Fox, Lee, and Sudakov. Their results included upper bounds for general graphs and lower bounds showing separation from classical Ramsey numbers. We show the first nontrivial results for ordered Ramsey numbers of specific small graphs. In particular we prove upper bounds for orderings of graphs on four vertices,

István Tomon, Ramsey properties of semilinear graphs

Zoom ID: 869 4632 6610 (ibsdimag)

A graph $G$ is semilinear of bounded complexity if the vertices of $G$ are elements of $\mathbb{R}^{d}$, and the edges of $G$ are defined by the sign patterns of $t$ linear functions, where $d$ and $t$ are constants. In this talk, I will present several results about the symmetric and asymmetric Ramsey properties of semilinear

Sang-il Oum (엄상일), What is an isotropic system?

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

Bouchet introduced isotropic systems in 1983 unifying some combinatorial features of binary matroids and 4-regular graphs. The concept of isotropic system is a useful tool to study vertex-minors of graphs and yet it is not well  known. I will give an introduction to isotropic systems.

Reinhard Diestel, Tangles of set separations: a novel clustering method and type recognition in machine learning

Zoom ID: 869 4632 6610 (ibsdimag)

Traditional clustering identifies groups of objects that share certain qualities. Tangles do the converse: they identify groups of qualities that typically occur together. They can thereby discover, relate, and structure types: of behaviour, political views, texts, or proteins. Tangles offer a new, quantitative, paradigm for grouping phenomena rather than things. They can identify key phenomena

Jungho Ahn (안정호), Well-partitioned chordal graphs with the obstruction set and applications

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

We introduce a new subclass of chordal graphs that generalizes split graphs, which we call well-partitioned chordal graphs. Split graphs are graphs that admit a partition of the vertex set into cliques that can be arranged in a star structure, the leaves of which are of size one. Well-partitioned chordal graphs are a generalization of

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

Raul Lopes, Adapting the Directed Grid Theorem into an FPT Algorithm

Zoom ID: 869 4632 6610 (ibsdimag)

The Grid Theorem of Robertson and Seymour is one of the most important tools in the field of structural graph theory, finding numerous applications in the design of algorithms for undirected graphs. An analogous version of the Grid Theorem in digraphs was conjectured by Johnson et al. , and proved by Kawarabayashi and Kreutzer .

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.