Related papers: Flows on flow-admissible signed graphs
Kriesel conjectured that every minimally $1$-tough graph has a vertex with degree precisely $2$. Katona and Varga (2018) proposed a generalized version of this conjecture which says that every minimally $t$-tough graph has a vertex with…
Vertex-fault-tolerance was introduced by Hayes~\cite{Hayes1976} in 1976, and since then it has been systematically studied in different aspects. In this paper we study $k$-vertex-fault-tolerant graphs for $p$ disjoint complete graphs of…
We prove that for any unweighted graph on n vertices the L1 norm of a unit electric current between the endpoints of a random edge is at most 2 log n. Furthermore, we show that on any weighted graph the spectral norm of the entry-wise…
We suggest the possibility to disentangle anisotropic flow, flow fluctuation, and nonflow using two-, four-, and six-particle azimuthal moments assuming Gaussian fluctuations. We show that such disentanglement is possible when the flow…
The Cauchy problem for the compressible flow of nematic liquid crystals in the framework of critical spaces is considered. We first establish the existence and uniqueness of global solutions provided that the initial data are close to some…
We prove the hydrodynamic limit of a totally asymmetric zero range process on a torus with two lanes and randomly oriented edges. The asymmetry implies that the model is non-reversible. The random orientation of the edges is constructed in…
Flow-based methods have achieved significant success in various generative modeling tasks, capturing nuanced details within complex data distributions. However, few existing works have exploited this unique capability to resolve…
We present a new experimental set-up that creates a shear flow with zero mean advection velocity achieved by counterbalancing the nonzero streamwise pressure gradient by moving boundaries, which generates plane Couette-Poiseuille flow. We…
Let $\hom(G)$ denote the size of the largest clique or independent set of a graph $G$. In 2007, Bukh and Sudakov proved that every $n$-vertex graph $G$ with $\hom(G) = O(\log n)$ contains an induced subgraph with $\Omega(n^{1/2})$ distinct…
This paper gives a framework to study a continuum limit of a gradient flow on a graph where the number of vertices increases in an appropriate way. As examples we prove the convergence of a discrete total variation flow and a discrete…
A signed graph is a graph in which each edge is labeled with $+1$ or $-1$. A (proper) vertex coloring of a signed graph is a mapping $\f$ that assigns to each vertex $v\in V(G)$ a color $\f(v)\in \mz$ such that every edge $vw$ of $G$…
We prove that there exists an open and dense subset of the incompressible 3-flows of class C^2 such that, if a flow in this set has a positive volume regular invariant subset with dominated splitting for the linear Poincar\'e flow, then it…
We study the Bowen topological entropy of generic and irregular points for certain dynamical systems. We define the topological entropy of noncompact sets for flows, analogous to Bowen's definition. We show that this entropy coincides with…
A graph $G$ is minimally $t$-tough if the toughness of $G$ is $t$ and the deletion of any edge from $G$ decreases the toughness. Kriesell conjectured that for every minimally $1$-tough graph the minimum degree $\delta(G)=2$. We show that in…
A priori estimates for the mean curvature evolution of Killing graphs in Cartan-Hadamard manifolds with asymptotic Dirichlet conditions are established. As an application, the existence of the corresponding parabolic flow is proved,…
Equistable graphs are graphs admitting positive weights on vertices such that a subset of vertices is a maximal stable set if and only if it is of total weight $1$. In $1994$, Mahadev et al.~introduced a subclass of equistable graphs,…
In this note, we prove that a finite vertex-transitive graph which has a clique which intersects all maximal cliques is a complete graph. This gives a positive answer in the case of vertex-transitive graphs to a question raised by Berge and…
The support of a flow $x$ in a network is the subdigraph induced by the arcs $uv$ for which $x(uv)>0$. We discuss a number of results on flows in networks where we put certain restrictions on structure of the support of the flow. Many of…
A shadowable point for a flow is a point where the shadowing lemma holds for pseudo-orbits passing through it. We prove that this concept satisfies the following properties: the set of shadowable points is invariant and a $G_{\delta}$ set.…
This article studies real roots of the flow polynomial $F(G,\lambda)$ of a bridgeless graph $G$. For any integer $k\ge 0$, let $\xi_k$ be the supremum in $(1,2]$ such that $F(G,\lambda)$ has no real roots in $(1,\xi_k)$ for all graphs $G$…