기초과학연구원 이산수학그룹
The k-color induced size-Ramsey number of a graph H is the smallest number of edges a (host) graph G can have such that for any k-coloring of its edges, there exists a monochromatic copy of H which is an induced subgraph of G. In 1995, in their seminal paper, Haxell, Kohayakawa and Łuczak showed that …
This workshop aims to foster collaborative discussions and explore the various aspects of vertex-minors, including structural theory and their applications. This event will be small-scale, allowing for focused talks and meaningful interactions among participants. Website: https://indico.ibs.re.kr/event/596/
An edge-coloured graph is said to be rainbow if it uses no colour more than once. Extremal problems involving rainbow objects have been a focus of much research over the last decade as they capture the essence of a number of interesting problems in a variety of areas. A particularly intensively studied question due to …
Graph product structure theory describes complex graphs in terms of products of simpler graphs. In this talk, I will introduce this subject and talk about some of my recent results in this area. The focus of my talk will be on a new tool in graph product structure theory called `blocking partitions.’ I’ll show how …
We prove that every finite colouring of the plane contains a monochromatic pair of points at an odd integral distance from each other.
The 3rd East Asia Workshop on Extremal and Structural Graph Theory is a workshop to bring active researchers in the field of extremal and structural graph theory, especially in the East Asia such as China, Japan, and Korea. Website: http://tgt.ynu.ac.jp/2023EastAsia.html
Determining the density required to ensure that a host graph G contains some target graph as a subgraph or minor is a natural and well-studied question in extremal combinatorics. The celebrated 50-year-old Erdős-Sós conjecture states that for every k, if G has average degree exceeding k-2 then it contains every tree T with k vertices …
Given a hypergraph $H=(V,E)$, we say that $H$ is (weakly) $m$-colorable if there is a coloring $c:V\to $ such that every hyperedge of $H$ is not monochromatic. The (weak) chromatic number of $H$, denoted by $\chi(H)$, is the smallest $m$ such that $H$ is $m$-colorable. A vertex subset $T \subseteq V$ is called a transversal …
Dirac's theorem determines the sharp minimum degree threshold for graphs to contain perfect matchings and Hamiltonian cycles. There have been various attempts to generalize this theorem to hypergraphs with larger uniformity by considering hypergraph matchings and Hamiltonian cycles. We consider another natural generalization of the perfect matchings, Steiner triple systems. As a Steiner triple system …
For $d\ge 2$ and an odd prime power $q$, let $\mathbb{F}_q^d$ be the $d$-dimensional vector space over the finite field $\mathbb{F}_q$. The distance between two points $(x_1,\ldots,x_d)$ and $(y_1,\ldots,y_d)$ is defined to be $\sum_{i=1}^d (x_i-y_i)^2$. An influential result of Iosevich and Rudnev is: if $E \subset \mathbb{F}_q^d$ is sufficiently large and $t \in \mathbb{F}_q$, then …