English
Related papers

Related papers: Nowhere-zero flows on signed eulerian graphs

200 papers

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…

Combinatorics · Mathematics 2013-05-30 Robert Šámal

In 1972, Tutte posed the $3$-Flow Conjecture: that all $4$-edge-connected graphs have a nowhere zero $3$-flow. This was extended by Jaeger et al.(1992) to allow vertices to have a prescribed, possibly non-zero difference (modulo $3$)…

Combinatorics · Mathematics 2020-11-03 Jamie V. de Jong , R. Bruce Richter

An (r,alpha)-bounded excess flow ((r,alpha)-flow) in an orientation of a graph G=(V,E) is an assignment of a real "flow value" between 1 and r-1 to every edge. Rather than 0 as in an actual flow, some flow excess, which does not exceed…

Combinatorics · Mathematics 2018-07-12 Michael Tarsi

We discuss general bosonic configurations of four-dimensional N=2 supergravity coupled to vector multiplets in (t,s) space-time. The supergravity theories with Euclidean and neutral signature are described by the so-called para-special…

High Energy Physics - Theory · Physics 2022-04-27 W. A. Sabra

This paper studies signed graphs with possible outer-edges. We introduce and investigate the chain group, the boundary operator, the co-boundary operator, the flow group, the tension group, the homology group, the cohomology group, with…

Combinatorics · Mathematics 2025-10-13 Beifang Chen

Let G=(V,E) be a simple undirected graph. For a given set L of the real line, a function omega from E to L is called an L-flow. Given a vector gamma whose coordinates are indexed by V, we say that omega is a gamma-L-flow if for each v in V,…

Combinatorics · Mathematics 2015-03-25 S. Akbari , S. Friedland , K. Markström , S. Zare

We discuss functions from edges and vertices of an undirected graph to an Abelian group. Such functions, when the sum of their values along any cycle is zero, are called balanced labelings. The set of balanced labelings forms an Abelian…

Combinatorics · Mathematics 2013-06-28 Yonah Cherniavsky , Avraham Goldstein , Vadim E. Levit

For integers $a\ge 2b>0$, a \emph{circular $a/b$-flow} is a flow that takes values from $\{\pm b, \pm(b+1), \dots, \pm(a-b)\}$. The Planar Circular Flow Conjecture states that every $2k$-edge-connected planar graph admits a circular…

Combinatorics · Mathematics 2020-07-14 Daniel W. Cranston , Jiaao Li

Given a graph $G$, the number of nowhere-zero $\ZZ_q$-flows $\phi_G(q)$ is known to be a polynomial in $q$. We extend the definition of nowhere-zero $\ZZ_q$-flows to simplicial complexes $\Delta$ of dimension greater than one, and prove the…

Combinatorics · Mathematics 2013-10-07 Matthias Beck , Yvonne Kemper

This paper is concerned with qualitative properties of bounded steady flows of an ideal incompressible fluid with no stagnation point in the two-dimensional plane R^2. We show that any such flow is a shear flow, that is, it is parallel to…

Analysis of PDEs · Mathematics 2018-10-03 Francois Hamel , Nikolai Nadirashvili

In this paper, we provide a classification of steady solutions to two-dimensional incompressible Euler equations in terms of the set of flow angles. The first main result asserts that the set of flow angles of any bounded steady flow in the…

Analysis of PDEs · Mathematics 2024-05-27 Changfeng Gui , Chunjing Xie , Huan Xu

We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P.

Computational Complexity · Computer Science 2007-05-23 Graham R. Brightwell , Peter Winkler

We prove an asymptotic formula for the number of Eulerian circuits for graphs with strong mixing properties and with vertices having even degrees. The exact value is determined up to the multiplicative error $O(n^{-1/2+\varepsilon})$, where…

Combinatorics · Mathematics 2015-06-11 Mikhail Isaev

In 1972 Tutte famously conjectured that every 4-edge-connected graph has a nowhere zero 3-flow; this is known to be equivalent to every 5-regular, 4-edge-connected graph having an edge orientation in which every in-degree is either 1 or 4.…

Combinatorics · Mathematics 2025-04-18 Michelle Delcourt , Reaz Huq , Pawel Pralat

A nuciferous graph is a simple graph with a non-singular $0$-$1$ adjacency matrix $A$ such that all the diagonal entries of $A^{-1}$ are zero and all the off-diagonal entries of $A^{-1}$ are non-zero. Sciriha et al. conjectured that except…

Combinatorics · Mathematics 2016-03-18 Ebrahim Ghorbani

Call a graph $G$ zero-forcing for a finite abelian group $\mathcal{G}$ if for every $\ell : V(G) \to \mathcal{G}$ there is a connected $A \subseteq V(G)$ with $\sum_{a \in A} \ell(a) = 0$. The problem we pose here is to characterise the…

Combinatorics · Mathematics 2016-10-17 Daniel Weißauer

It is shown that bounds of all orders of derivative would follow from uniform bounds for the metric and the torsion 1-form, for a flow in non-K\"ahler geometry which can be interpreted as either a flow for the Type IIB string or the Anomaly…

Differential Geometry · Mathematics 2020-05-01 Teng Fei , Duong H. Phong , Sebastien Picard , Xiangwen Zhang

In this work we study the geodesic flow on nilmanifolds associated to graphs. We are interested in the construction of first integrals to show complete integrability on some compact quotients. Also examples of integrable geodesic flows and…

Differential Geometry · Mathematics 2019-05-30 Gabriela P. Ovando

In 1972, Tutte posed the $3$-Flow Conjecture: that all $4$-edge-connected graphs have a nowhere zero $3$-flow. This was extended by Jaeger et al.(1992) to allow vertices to have a prescribed, possibly non-zero difference (modulo $3$)…

Combinatorics · Mathematics 2020-11-05 Jamie V. de Jong

In 1982 V\'{i}ctor Neumann-Lara introduced the dichromatic number of a digraph $D$ as the smallest integer $k$ such that the vertices $V$ of $D$ can be colored with $k$ colors and each color class induces an acyclic digraph. Later a flow…

Combinatorics · Mathematics 2019-01-08 Barbara Altenbokum , Winfried Hochstättler , Johanna Wiehe
‹ Prev 1 3 4 5 6 7 10 Next ›