Hidde Koerts, Characterizing large clique number in tournaments
A backedge graph of a tournament $T$ with respect to a total ordering $\prec$ of the vertices of $T$ is a graph on $V(T)$ where $uv$ is an edge if …
8 events found.
Discrete Math Seminar
Events
-
-
Room B332 IBS (기초과학연구원)
-
Tung H. Nguyen, Polynomial χ-boundedness for excluding the five-vertex path
Room B332 IBS (기초과학연구원)We overview the recent resolution of a 1985 open problem of Gyárfás, that chromatic number is polynomially bounded by clique number for graphs with no induced five-vertex path. The proof …
-
-
Mamadou Moustapha Kanté, TBA
Room B332 IBS (기초과학연구원) -
Xin Wei, Separating hash families with large universe
Room B332 IBS (기초과학연구원)Separating hash families are useful combinatorial structures that generalize several well-studied objects in cryptography and coding theory. Let $p_t(N, q)$ denote the maximum size of the universe for a $t$-perfect …
-
-
Xavier Goaoc, TBA
Room B332 IBS (기초과학연구원) -
Sarah Morell, Unsplittable Transshipments
Room B332 IBS (기초과학연구원)We consider an arc-capacitated directed graph $D=(V,A)$, where each node $v$ is associated with a rational balance value $b(v)$. Nodes with negative balance values are referred to as sources, while …
-
-
Maria Chudnovsky, TBA
Room B332 IBS (기초과학연구원) -
Martin Milanič, TBA
Room B332 IBS (기초과학연구원)