기초과학연구원 이산수학그룹
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 …
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$ …
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 …
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 …