Related papers: The Langberg-M\'{e}dard Multiple Unicast Conjectur…
In two-sided matching markets, the agents are partitioned into two sets. Each agent wishes to be matched to an agent in the other set and has a strict preference over these potential matches. A matching is stable if there are no blocking…
In [W. Mader, Connectivity keeping paths in $k$-connected graphs, J. Graph Theory 65 (2010) 61-69.], Mader conjectured that for every positive integer $k$ and every finite tree $T$ with order $m$, every $k$-connected, finite graph $G$ with…
The theory of complex networks and of disordered systems is used to study the stability and dynamical properties of a simple model of material flow networks defined on random graphs. In particular we address instabilities that are…
Mader conjectured that for any tree $T$ of order $m$, every $k$-connected graph $G$ with minimum degree at least $\lfloor\frac{3k}{2}\rfloor +m-1$ contains a subtree $T'\cong T$ such that $G-V(T')$ is $k$-connected. In this paper, we give a…
A matching $M$ in a graph $G$ is uniquely restricted if no other matching in $G$ covers the same set of vertices. We conjecture that every connected subcubic graph with $m$ edges and $b$ bridges that is distinct from $K_{3,3}$ has a…
Networked systems are susceptible to cascading failures, where the failure of an initial set of nodes propagates through the network, often leading to system-wide failures. In this work, we propose a multiplex flow network model to study…
We consider the piecewise-deterministic Markov process obtained by randomly switching between the flows generated by a finite set of smooth vector fields on a compact set. We obtain H\"ormander-type conditions on the vector fields…
In 1965 Erd\H os conjectured that for all $k\ge2$, $s\ge1$ and $n\ge k(s+1)$, an $n$-vertex $k$-uniform hypergraph $\F$ with $\nu(\F)=s$ cannot have more than \newline $\max\{\binom{sk+k-1}k,\;\binom nk-\binom{n-s}k\}$ edges. It took almost…
A class of graphs is bridge-addable if given a graph $G$ in the class, any graph obtained by adding an edge between two connected components of $G$ is also in the class. We prove a conjecture of McDiarmid, Steger, and Welsh, that says that…
This two-part paper details a theory of solvability for the power flow equations in lossless power networks. In Part I, we derived a new formulation of the lossless power flow equations, which we term the fixed-point power flow. The model…
Zero-one biochemical reaction networks play key roles in cell signalling such as signalling pathways regulated by protein phosphorylation. Multistability of reaction networks is a crucial dynamics feature enabling decision-making in cells.…
This paper establishes that the strong converse holds for some classes of discrete memoryless multimessage multicast networks (DM-MMNs) whose corresponding cut-set bounds are tight, i.e., coincide with the set of achievable rate tuples. The…
We study the multistationarity for the reaction networks with one-dimensional stoichiometric subspaces, and we focus on the networks admitting finitely many positive steady states. We prove that if a network admits multistationarity, then…
An unexpected and somewhat surprising observation is that two counter-cascaded systems, given the right conditions, can exhibit multivaluedness from one of the outputs to the other. The main result presented here is a necessary and…
Several emerging classes of applications that run over wireless networks have a need for mathematical models and tools to systematically characterize the reliability of the network. We propose two metrics for measuring the reliability of…
Motivated by the problem of dealing with incomplete or imprecise acquisition of data in computer vision and computer graphics, we extend results concerning the stability of persistent homology with respect to function perturbations to…
The classical Okamura-Seymour theorem states that for an edge-capacitated, multi-commodity flow instance in which all terminals lie on a single face of a planar graph, there exists a feasible concurrent flow if and only if the cut…
We address a special case of a conjecture of M. Talagrand relating two notions of "threshold" for an increasing family $\mathcal F$ of subsets of a finite set $V$. The full conjecture implies equivalence of the "Fractional…
Tutte conjectured in 1972 that every 4-edge connected graph has a nowhere-zero 3-flow. This has long been known to be equivalent to the conjecture that every 5-regular 4-edge-connected graph has an edge orientation in which every out-degree…
Efficient computability is an important property of solution concepts in matching markets. We consider the computational complexity of finding and verifying various solution concepts in trading networks-multi-sided matching markets with…