Related papers: Nowhere-zero 5-flow on signed ladders

For a bridgeless graph $G$, its flow polynomial is defined to be the function $F(G,q)$ which counts the number of nonwhere-zero $\Gamma$-flows on an orientation of $G$ whenever $q$ is a positive integer and $\Gamma$ is an additive Abelian…

Borodin and Kostochka conjectured that every graph $G$ with $\Delta\ge9$ satisfies $\chi\le$ max $\{\omega, \Delta-1\}$. Gupta and Pradhan proved the Borodin-Kostochka conjecture for ($P_5$, $C_4$)-free graphs [{\em J. Appl. Math. Comp.}…

We prove that every factor map between topological flows preserves the standard shadowing property if it is injective except for a closed orbit that shrinks to a singularity. As an application, we construct a $C^\infty$-flow on a…

We consider the inverse mean curvature flow in smooth Riemannian manifolds of the form $([R_{0},\infty)\times S^n,\bar{g})$ with metric $\bar{g}=dr^2+{\vartheta}^2(r){\sigma}$ and non-positive radial sectional curvature. We prove, that for…

We show uniqueness of Ricci flows starting at a surface of uniformly negative curvature, with the assumption that the flows become complete instantaneously. Together with the more general existence result proved in [10], this settles the…

We determine, for all $k\geq 6$, the typical structure of graphs that do not contain an induced $2k$-cycle. This verifies a conjecture of Balogh and Butterfield. Surprisingly, the typical structure of such graphs is richer than that…

Jaeger, Linial, Payan, and Tarsi introduced the notion of $A$-connectivity for graphs in 1992, and proved a decomposition for cubic graphs from which $A$-connectivity follows for all 3-edge-connected graphs when $|A|\geq 6$. The concept of…

We announce results about flat (linkless) embeddings of graphs in 3-space. A piecewise-linear embedding of a graph in 3-space is called {\it flat} if every circuit of the graph bounds a disk disjoint from the rest of the graph. We have…

We prove that oriented and standard shadowing properties are equivalent for topological flows on closed surfaces with the nonwandering set consisting of the finite number of critical elements (i.e., singularities or closed orbits).…

We motivate and discuss several recent results on non-existence of irrotational inviscid flow around bounded solids that have two or more protruding corners, complementing classical results for the case of a single protruding corner. For a…

In 1961, Gomory and Hu showed that the All-Pairs Max-Flow problem of computing the max-flow between all $n\choose 2$ pairs of vertices in an undirected graph can be solved using only $n-1$ calls to any (single-pair) max-flow algorithm. Even…

Let \Gamma be a signed graph and let A(\Gamma) be the adjacency matrix of \Gamma. The nullity of \Gamma is the multiplicity of eigenvalue zero in the spectrum of A(\Gamma). In this paper we characterize the signed graphs of order n with…

The boundary conditions prescribing the constant traction or the so-called do-nothing conditions are frequently taken on artificial boundaries in the numerical simulations of steady flow of incompressible fluids, despite the fact that they…

A property of n-vertex graphs is called evasive if every algorithm testing this property by asking questions of the form "is there an edge between vertices u and v" requires, in the worst case, to ask about all pairs of vertices. Most…

Lov\'asz has completely characterised the structure of graphs with no two vertex-disjoint cycles, while Slilaty has given a structural characterisation of graphs with no two vertex-disjoint odd cycles; his result is in fact more general,…

We show that if a closed manifold M admits an F-structure (possibly of rank 0) then its minimal entropy vanishes. In particular, this is the case if M admits a non-trivial circle action. As a corollary we obtain that the simplicial volume…

A lemma of Fouquet implies that a claw-free graph contains an induced $C_5$, contains no odd hole, or is quasi-line. In this paper we use this result to give an improved shortest-odd-hole algorithm for claw-free graphs by exploiting the…

A classic theorem of Dirac from 1952 states that every graph with minimum degree at least n/2 contains a Hamiltonian cycle. In 1963, P\'osa conjectured that every graph with minimum degree at least 2n/3 contains the square of a Hamiltonian…

We examine the conditions under which a signed graph contains an edge or a vertex that is contained in a unique negative circle or a unique positive circle. For an edge in a unique signed circle, the positive and negative case require the…

A non-slip boundary condition at a wall for the lattice Boltzmann method is presented. In the present method unknown distribution functions at the wall are assumed to be an equilibrium distribution function with a counter slip velocity…