기초과학연구원 이산수학그룹
An archetype problem in extremal combinatorics is to study the structure of subgraphs appearing in different classes of (hyper)graphs. We will focus on such embedding problems in uniformly dense hypergraphs. …
Consider the following hat guessing game: $n$ players are placed on $n$ vertices of a graph, each wearing a hat whose color is arbitrarily chosen from a set of $q$ …
A theoretical dynamical system is a pair (X,T) where X is a compact metric space and T is a self homeomorphism of X. The topological entropy of a theoretical dynamical system …
The well-known 1-2-3 Conjecture by Karoński, Łuczak and Thomason states that the edges of any connected graph with at least three vertices can be assigned weights 1, 2 or 3 …
Program 9:40-10:05: Sang-il OUM, Obstructions for dense analogs of tree-depth 10:05-10:20: Kevin HENDREY, Structural and extremal results for twin-width 10:20-10:35: Rutger CAMPBELL, Down-sets in combinatorial posets 10:35-10:50: Linda COOK, Reuniting …
In a rainbow variant of the Turán problem, we consider $k$ graphs on the same set of vertices and want to determine the smallest possible number of edges in each …
A loose cycle is a cyclic ordering of edges such that every two consecutive edges share exactly one vertex. A cycle is Hamilton if it spans all vertices. A codegree …
Ramsey's Theorem guarantees for every graph H that any 2-edge-coloring of a sufficiently large complete graph contains a monochromatic copy of H. As probabilistic constructions often provide good bounds on …
2023 Mini-Workshop on Discrete Geometry will be held on August 9th at Room B332, Institute for Basic Science (IBS), Daejeon, Republic of Korea. The workshop consists of three presentations on …
How can one arrange a collection of convex sets in d-dimensional Euclidean space? This guiding question is fundamental in discrete geometry, and can be made concrete in a variety of …