Related papers: Graph Puzzles II.1: Counterexamples to Jain's Seco…
A set S of vertices in a graph G is a dominating set of G if every vertex not in S is adjacent to a vertex in S . The domination number of G, denoted by $\gamma$(G), is the minimum cardinality of a dominating set in G. In a breakthrough…
We explore the well-known Jaeger's directed cycle double cover conjecture which is equivalent to the assertion that every cubic bridgeless graph has an embedding on a closed orientable surface with no dual loop. We associate each cubic…
Erd\H{o}s conjectured that every $n$-vertex triangle-free graph contains a subset of $\lfloor n/2\rfloor$ vertices that spans at most $n^2/50$ edges. Extending a recent result of Norin and Yepremyan, we confirm this conjecture for graphs…
A graph is "$H$-free" if it has no induced subgraph isomorphic to $H$. A conjecture of Conlon, Fox and Sudakov states that for every graph $H$, there exists $s>0$ such that in every $H$-free graph with $n>1$ vertices, either some vertex has…
In this paper, we derive a number of interesting properties and extensions of the convex flow problem from the perspective of convex geometry. We show that the sets of allowable flows always can be imbued with a downward closure property,…
In this article, we study the ergodicity of the geodesic flows on surfaces with no focal points. Let $M$ be a smooth connected and closed surface equipped with a $C^\infty$ Riemannian metric $g$, whose genus $\mathfrak{g} \geq 2$. Suppose…
We define a new geometric flow, which we shall call the $K$-flow, on 3-dimensional Riemannian manifolds; and study the behavior of Thurston's model geometries under this flow both analytically and numerically. As an example, we show that an…
An $n$-vertex graph is said to to be $(p,\beta)$-bijumbled if for any vertex sets $A,B\subseteq V(G)$, we have \[e(A,B)=p|A||B|\pm \beta \sqrt{|A||B|}.\] We prove that for any $3\leq r\in \mathbb{N}$ and $c>0$ there exists an…
For each end of complete minimal surface in the Euclidean 3-space, the flux vector is defined. It is well-known that the sum of the flux vector over all ends are zero. Consider the following inverse problem: For each balanced n-vectors,…
We look for a non-zero $(0, 1)$-vector in the row space of the adjacency matrix $A(\Gamma)$ of a graph $\Gamma,$ provided $\Gamma$ has at least one edge. Akbari, Cameron, and Khosrovshahi conjectured that there exists a non-zero…
We prove that every graph $G$ on $n$ vertices with no isolated vertices contains an induced subgraph of size at least $n/10000$ with all degrees odd. This solves an old and well-known conjecture in graph theory.
A total dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every vertex of $G$ has a neighbor in $D$. A locating-total dominating set of $G$ is a total dominating set $D$ of $G$ with the additional property that every…
We prove an existence result for solutions to the stationary Euler equations in a domain with nonsmooth boundary. This is an extension of a previous existence result in smooth domains by Alber (1992). The domains we consider have a boundary…
Given a flow on a 3-dimensional integral homology sphere, we give a formula for the Euler characteristic of its transverse surfaces, in terms of boundary data only. We illustrate the formula with several examples, in particular with…
In the Flow Edge-Monitor Problem, we are given an undirected graph G=(V,E), an integer k > 0 and some unknown circulation \psi on G. We want to find a set of k edges in G, so that if we place k monitors on those edges to measure the flow…
We show that if $G$ is a simple triangle-free graph with $n\geq 3$ vertices, without a perfect matching, and having a minimum degree at least $\frac{n-1}{2}$, then $G$ is isomorphic either to $C_5$ or to $K_{\frac{n-1}{2},\frac{n+1}{2}}$.
We consider the nonlinear problem of steady gravity-driven waves on the free surface of a two-dimensional flow of an incompressible fluid (say, water). The flow is assumed to be unidirectional of finite depth and the water motion is…
We analyze the action of the spectral flows on N=2 twisted topological theories. We show that they provide a useful mapping between the two twisted topological theories associated to a given N=2 superconformal theory. This mapping can also…
We present a definition of spectral flow relative to any norm closed ideal J in any von Neumann algebra N. Given a path D(t) of selfadjoint operators in N which are invertible in N/J, the spectral flow produces a class in K_0(J). In the…
The well-known 1-2-3 Conjecture asserts that the edges of every graph without isolated edges can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general, while it is known to be…