Related papers: Graph Puzzles II.1: Counterexamples to Jain's Seco…
Let $G$ be a bridgeless cubic graph. In 2023, the three authors solved a conjecture (also known as the $S_4$-Conjecture) made by Mazzuoccolo in 2013: there exist two perfect matchings of $G$ such that the complement of their union is a…
A graph $G$ contains $H$ as an \emph{immersion} if there is an injective mapping $\phi: V(H)\rightarrow V(G)$ such that for each edge $uv\in E(H)$, there is a path $P_{uv}$ in $G$ joining vertices $\phi(u)$ and $\phi(v)$, and all the paths…
A conjecture of Fan and Raspaud [3] asserts that every bridgeless cubic graph con-tains three perfect matchings with empty intersection. Kaiser and Raspaud [6] sug-gested a possible approach to this problem based on the concept of a…
It is proven that the only incompressible Euler fluid flows with fixed straight streamlines are those generated by the normal lines to a round sphere, a circular cylinder or a flat plane, the fluid flow being that of a point source, a line…
We are concerned with the theory of existence and uniqueness of flows generated by divergence free vector fields with compact support. Hence, assuming that the velocity vector fields are measurable, bounded, and the flows in the Euclidean…
We provide a combinatorial presentation of the set F of 3-dimensional generic flows, namely the set of pairs (M,v) with M a compact oriented 3-manifold and v a nowhere-zero vector field on M having generic behaviour along the boundary of M,…
We characterize, using commuting zero-flux homologies, those volume-preserving vector fields on a $3$-manifold that are steady solutions of the Euler equations for some Riemannian metric. This result extends Sullivan's homological…
Karo\'nski, {\L}uczak and Thomason conjectured in 2004 that for every finite graph without isolated edge, the edges can be assigned weights from $\{1,2,3\}$ in such a way that the endvertices of each edge have different sums of incident…
Erd\H{o}s conjectured that every triangle-free graph $G$ on $n$ vertices contains a set of $\lfloor n/2 \rfloor$ vertices that spans at most $n^2 /50$ edges. Krivelevich proved the conjecture for graphs with minimum degree at least…
A graph $G=(V(G), E(G))$ is supereulerian if it has a spanning Eulerian subgraph. Let $\ell(G)$ be the maximum number of edges of spanning Eulerian subgraphs of a supereulerian graph $G$. In $1996$, Catlin conjectured that if $G$ is a…
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$…
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…
The paper is devoted to the study of topological properties, structure and classification of Morse flows with fixed points on the boundary of three-dimensional manifolds. We construct a complete topological invariant of a Morse flow,…
We survey known results related to nowhere-zero flows and related topics, such as circuit covers and the structure of circuits of signed graphs. We include an overview of several different definitions of signed graph colouring.
Consider a fluid flowing through a junction between two pipes with different sections. Its evolution is described by the 2D or 3D Euler equations, whose analytical theory is far from complete and whose numerical treatment may be rather…
The Erdos-Hajnal conjecture states that if a graph on n vertices is H-free, that is, it does not contain an induced copy of a given graph H, then it must contain either a clique or an independent set of size n^{d(H)}, where d(H) > 0 depends…
In 1979 Frankl conjectured that in a finite non-trivial union-closed collection of sets there has to be an element that belongs to at least half the sets. We show that this is equivalent to the conjecture that in a finite non-trivial graph…
The flow semigroup, introduced by John Rhodes, is an invariant for digraphs and a complete invariant for graphs. After collecting together previous partial results, we refine and prove Rhodes's conjecture on the structure of the maximal…
Consider an arbitrary closed, countably $n$-rectifiable set in a strictly convex $(n+1)$-dimensional domain, and suppose that the set has finite $n$-dimensional Hausdorff measure and the complement is not connected. Starting from this given…
In this paper, we prove a tight minimum degree condition in general graphs for the existence of paths between two given endpoints, whose lengths form a long arithmetic progression with common difference one or two. This allows us to obtain…