Chính T. Hoàng, Problems on graph coloring
A k-coloring of a graph is an assignment of k colors to its vertices such that no two adjacent adjacent vertices receive the same color. The Coloring Problem is the …
10 events found.
Events
-
-
Room B332 IBS (기초과학연구원)
-
Dario Cavallaro, Well-quasi-ordering Eulerian directed Graphs by (strong) Immersion
Room B332 IBS (기초과학연구원)Directed graphs prove to be very hard to tame in contrast to undirected graphs. In particular, they are not well-quasi-ordered by any known relevant inclusion relation, and are lacking fruitful …
-
József Balogh, Clique covers and decompositions of cliques of graphs
Room B332 IBS (기초과학연구원)Two related papers will be discussed: 1. In 1966, Erdős, Goodman, and Pósa showed that if $G$ is an $n$-vertex graph, then at most $\lfloor n^2/4 \rfloor$ cliques of $G$ …
-
Hidde Koerts, Characterizing large clique number in tournaments
Room B332 IBS (기초과학연구원)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 …
-
Tung H. Nguyen, TBA
Room B332 IBS (기초과학연구원) -
-
Mamadou Moustapha Kanté, TBA
Room B332 IBS (기초과학연구원) -
-
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 (기초과학연구원)