Hyunwoo Lee (이현우), Proof of the Erdős-Szemerédi sunflower conjecture
In the 1970s, Erdős and Szemerédi conjectured that for any $n \ge k-1\ge 2$, any collection of subsets of $$ not containing a $k$-sunflower has size at most $c_k^n$ for …
8 events found.
Discrete Math Seminar
Events
-
-
Room B332 IBS (기초과학연구원)
-
-
Hikaru Yokoi, The self-duality of pathwidth
Room B332 IBS (기초과학연구원)How close are the width parameters of a plane graph and its (geometric) dual? Research motivated by this question, known as the self-duality of width parameters, originated from the seminal …
-
Denys Bulavka, TBA
Room B332 IBS (기초과학연구원)TBA
-
Joonkyung Lee (이준경), TBA
Room B332 IBS (기초과학연구원)TBA
-
-
William J. Wesley, An elementary solution to the 2-color Pythagorean triples problem
Room B332 IBS (기초과학연구원)In the 1980s, Ron Graham asked whether every red/blue coloring of the positive integers contains a monochromatic Pythagorean triple and offered a $100 prize for the answer. The bounty was …
-
Mingyuan Rong, The codegree Turán density of tight cycles
Room B332 IBS (기초과학연구원)The codegree Turán density γ(F) of a k-uniform hypergraph F is the smallest γ ≥ 0 with the following property: if every set of k−1 vertices in an n-vertex k-uniform …
-
Jaehyun Koo (구재현), Dynamic Graph Coloring: Sequential, Parallel, and Distributed
Room B332 IBS (기초과학연구원)For any graph with maximum degree at most $\Delta$, a simple inductive argument shows that the graph can be properly colored using $\Delta+1$ colors. However, a direct implementation of this …
-
-
Changki Yun (윤창기), TBA
Room B332 IBS (기초과학연구원)TBA