Younjin Kim (김연진), On the extremal problems related to Szemerédi’s theorem
Room B232 IBS (기초과학연구원)In 1975, Szemerédi proved that for every real number
In 1975, Szemerédi proved that for every real number
The first-order model checking problem for finite graphs asks, given a graph G and a first-order sentence
We introduce an odd coloring of a graph, which was introduced very recently, motivated by parity type colorings of graphs. A proper vertex coloring of graph
We prove that for every graph F with at least one edge there are graphs H of arbitrarily large chromatic number and the same clique number as F such that …
In this talk, we introduce homomorphisms between binary matroids that generalize graph homomorphisms. For a binary matroid
The upper tail problem for subgraph counts in the Erdos-Renyi graph, introduced by Janson-Ruciński, has attracted a lot of attention. There is a class of Gibbs measures associated with subgraph …
Hadwiger's transversal theorem gives necessary and sufficient conditions for the existence of a line transversal to a family of pairwise disjoint convex sets in the plane. These conditions were subsequently …
We present a canonical way to decompose finite graphs into highly connected local parts. The decomposition depends only on an integer parameter whose choice sets the intended degree of locality. …
For a set
Reconfiguration is about changing instances in small steps. For example, one can perform certain moves on a Rubik's cube, each of them changing its configuration a bit. In this case, …