Related papers: Volume inequalities for flow polytopes of full dir…

The problem of finding upper bounds for minimal vertex number of graphs with a given automorphism group is addressed in this article for the case of cyclic $2$-groups. We show that for any natural $n\ge 2$ there is an undirected graph…

In this paper we consider a ``flow'' of nonparametric solutions of the volume constrained Plateau problem with respect to a convex planar curve. Existence and regularity is obtained from standard elliptic theory, and convexity results for…

This article is the complement to [quant-ph/0611284], which proves that flows (as introduced by [quant-ph/0506062]) can be found efficiently for patterns in the one-way measurement model which have non-empty input and output subsystems of…

Motivated by bit threads, we introduce a new prescription for computing entropy vectors outside the holographic entropy cone. By utilizing cycle flows on directed graphs, we show that the maximum cycle flow associated to any subset of…

We study the long time existence theory for a non local flow associated to a free boundary problem for a trapped non liquid drop. The drop has free boundary components on two horizontal plates and its free energy is anisotropic and axially…

We consider the dynamics of vector fields on three-manifolds which are constrained to lie within a plane field, such as occurs in nonholonomic dynamics. On compact manifolds, such vector fields force dynamics beyond that of a gradient flow,…

A graph is k-linked if any k disjoint vertex-pairs can be joined by k disjoint paths. We improve a lower bound on the linkedness of polytopes slightly, which results in exact values for the minimal linkedness of 7-, 10- and 13-dimensional…

If the nodes of a graph are considered to be identical barrels - featuring different water levels - and the edges to be (locked) water-filled pipes in between the barrels, one might consider the optimization problem of how much the water…

In this work we study the asymptotic traffic flow in Gromov's hyperbolic graphs. We prove that under certain mild hypotheses the traffic flow in a hyperbolic graph tends to pass through a finite set of highly congested nodes. These nodes…

In this paper, we introduce a new concept namely degree polynomial for vertices of a simple graph. This notion leads to a concept namely degree polynomial sequence which is stronger than the concept of degree sequence. After obtaining the…

It is folklore that the cycle space of graphs of polytopes is generated by the cycles bounding the 2-faces. We provide a proof of this result that bypass homological arguments, which seem to be the most widely known proof. As a corollary,…

Many questions at the core of graph theory can be formulated as questions about certain group-valued flows: examples are the cycle double cover conjecture, Berge-Fulkerson conjecture, and Tutte's 3-flow, 4-flow, and 5-flow conjectures. As…

For each nonnegative integer $i$, let $a_i$ be the number of $i$-subsets of $V(G)$ that induce an acyclic subgraph of a given graph $G$. We define $A(G,x) = \sum_{i \geq 0} a_i x^i$ (the generating function for $a_i$) to be the acyclic…

An explicit algorithm is presented for testing whether two non-directed graphs are isomorphic or not. It is shown that for a graph of n vertices, the number of n independent operations needed for the test is polynomial in n. A proof that…

In causal inference on directed acyclic graphs, the orientation of edges is in general only recovered up to Markov equivalence classes. We study Markov equivalence classes of uniformly random directed acyclic graphs. Using a tower…

We show that the groupoids of two directed graphs are isomorphic if and only if the two graphs are orbit equivalent by an orbit equivalence that preserves isolated eventually periodic points. We also give a complete description of the…

Barotropic fluid flows with the same circulation structure as steady flows generically have comoving physical surfaces on which the vortex lines lie. These become Bernoullian surfaces when the flow is steady. When these surfaces are nested…

We consider directed graph algorithms in a streaming setting, focusing on problems concerning orderings of the vertices. This includes such fundamental problems as topological sorting and acyclicity testing. We also study the related…

We call a topological ordering of a weighted directed acyclic graph non-negative if the sum of weights on the vertices in any prefix of the ordering is non-negative. We investigate two processes for constructing non-negative topological…

Acyclic and cyclic orientations of an undirected graph have been widely studied for their importance: an orientation is acyclic if it assigns a direction to each edge so as to obtain a directed acyclic graph (DAG) with the same vertex set;…