기초과학연구원 이산수학그룹
Let $G = (V, E)$ be a graph on $n$ vertices, and let $c : E \to P$, where $P$ is a set of colors. Let $\delta^c(G) = \min_{v \in V} \{ d^{c}(v) \}$ where $d^c(v)$ is the number of colors on edges incident to a vertex $v$ of $G$. In 2011, Fujita and Magnant …
Flag algebras are a mathematical framework introduced by Alexander Razborov in 2007, which has been used to resolve a wide range of open problems in extremal graph theory in the past twenty years. This framework provides an algebraic setup where one can express relationships between induced subgraph densities symbolically. It also comes with mathematical techniques …
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 those with positive balance values are called sinks. A feasible $b$-transshipment is a flow $f : A \to \mathbb{R}_{\ge 0}$ that routes the total supply …