Mingyuan Rong, The codegree Turán density of tight cycles
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 …
3 events found.
Discrete Math Seminar
Events
-
-
Room B332 IBS (기초과학연구원)
-
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