Related papers: A Note on the Balanced ST-Connectivity

For each integer $\ell \geq 4$, we give a polynomial-time algorithm to test whether a graph contains an induced cycle with length at least $\ell$ and even

In this letter we introduce a class of delayed kinetic systems derived from mass action type reaction network models. We define the time delayed positive stoichiometric compatibility classes and the notion of complex balanced time delayed…

We give an affirmative answer to a long-standing conjecture of Thomassen, stating that every sufficiently highly connected graph has a $k$-vertex-connected orientation. We prove that a connectivity of order $O(k^2)$ suffices. As a key tool,…

We consider a joint source-channel coding problem on a finite-field multiway relay channel, and we give closed-form lower and upper bounds on the optimal source-channel rate. These bounds are shown to be tight for all discrete memoryless…

It is well-known that every planar graph has a Tutte path, i.e., a path $P$ such that any component of $G-P$ has at most three attachment points on $P$. However, it was only recently shown that such Tutte paths can be found in polynomial…

Let $P$ be a set of $2n$ points in convex position, such that $n$ points are colored red and $n$ points are colored blue. A non-crossing alternating path on $P$ of length $\ell$ is a sequence $p_1, \dots, p_\ell$ of $\ell$ points from $P$…

Our previous paper shows that the (vertex) spanning tree degree enumerator polynomial of a connected graph $G$ is a real stable polynomial (id est is non-zero if all variables have positive imaginary parts) if and only if $G$ is…

This paper studies path stabilities of the solution to stochastic differential equations (SDE) driven by time-changed L\'evy noise. The conditions for the solution of time-changed SDE to be path stable and exponentially path stable are…

We initiate the study of a fundamental combinatorial problem: Given a capacitated graph $G=(V,E)$, find a shortest walk ("route") from a source $s\in V$ to a destination $t\in V$ that includes all vertices specified by a set…

We show that every balanced pair (see Definition 1.1) of real $2\times 2$ matrices admits a unique Lyapunov maximizing measure, and the measure is always Sturmian.

We prove that a connected graph contains a circuit---a closed walk that repeats no edges---through any $k$ prescribed edges if and only if it contains no odd cut of size at most $k$.

The disjoint paths problem is a fundamental problem in algorithmic graph theory and combinatorial optimization. For a given graph $G$ and a set of $k$ pairs of terminals in $G$, it asks for the existence of $k$ vertex-disjoint paths…

We consider the stable assignment problem on a graph with nonnegative real capacities on the edges and quotas on the vertices, in which the preferences of agents are given via diversifying choice functions. We prove that for any input of…

In this paper we are interested in BB knots, namely knots and links where the bridge index equals the braid index. Supported by observations from experiments, it is conjectured that BB knots possess a special geometric/physical property…

Explicit examples of {\bf positive} crystalline measures and Fourier quasicrystals are constructed using pairs of stable of polynomials, answering several open questions in the area.

The signature of a rectifiable path is a tensor series in the tensor algebra whose coefficients are definite iterated integrals of the path. The signature characterises the path up to a generalised form of reparametrisation. It is a…

Structural balance theory predicts that triads in networks gravitate towards stable configurations. The theory has been verified for undirected graphs. Since real-world networks are often directed, we introduce a novel method for…

We provide a complete combinatorial and asymptotic analysis of positive linear systems of equations in one catalytic variable that appear in several combinatorial problems such as in lattice path counting or stack-sortable permutation…

We study asymptotic behavior of the stability thresholds of a big line bundle, and prove explicit bounds on the error terms. This answers Jin--Rubinstein--Tian's questions affirmatively. A key step in our proof is to show that the stability…

The {\sc weak 2-linkage} problem for digraphs asks for a given digraph and vertices $s_1,s_2,t_1,t_2$ whether $D$ contains a pair of arc-disjoint paths $P_1,P_2$ such that $P_i$ is an $(s_i,t_i)$-path. This problem is NP-complete for…