Related papers: A common variable minimax theorem for graphs

We prove that after an arbitrarily small adjustment of edge lengths, the spectrum of a compact quantum graph with $\delta$-type vertex conditions can be simple. We also show that the eigenfunctions, with the exception of those living…

We show that Caratheodory's conjecture, on umbilical points of closed convex surfaces, may be reformulated in terms of the existence of at least one umbilic in the graphs of functions f: R^2-->R whose gradient decays uniformly faster than…

An invariant for cospectral graphs is a property shared by all cospectral graphs. In this paper, we establish three novel arithmetic invariants for cospectral graphs, revealing deep connections between spectral properties and combinatorial…

Consider a sum of convex functions, where the only information known about each individual summand is the location of a minimizer. In this work, we give an exact characterization of the set of possible minimizers of the sum. Our results…

This paper establishes three minimax theorems for possibly nonconvex functions on Euclidean spaces or on infinite-dimensional Hilbert spaces. The theorems also guarantee the existence of saddle points. As a by-product, a complete solution…

A recent result of Chepoi, Estellon and Vaxes [DCG '07] states that any planar graph of diameter at most 2R can be covered by a constant number of balls of size R; put another way, there are a constant-sized subset of vertices within which…

From a graph $G$ with constant valency $v$ and a (non-compact) manifold $C$ with $v$ boundary components, we build a $G$-periodic manifold $M$. This process gives a class of topologically infinite manifolds which generalizes periodic…

We consider immersions admitting uniform graph representations over the affine tangent space over a ball of fixed radius r>0. We show that for sufficiently small C^0-norm of the graph functions, each graph function is smooth with small…

Given a smooth curve $\gamma$ in some $m$-dimensional surface $M$ in $\mathbb{R}^{m+1}$, we study existence and uniqueness of a flat surface $H$ having the same field of normal vectors as $M$ along $\gamma$, which we call a flat…

A cornerstone theorem in the Graph Minors series of Robertson and Seymour is the result that every graph $G$ with no minor isomorphic to a fixed graph $H$ has a certain structure. The structure can then be exploited to deduce far-reaching…

We prove that if $G$ is a graph and $f(v) \leq 1/(d(v) + 1/2)$ for each $v\in V(G)$, then either $G$ has an independent set of size at least $\sum_{v\in V(G)}f(v)$ or $G$ contains a clique $K$ such that $\sum_{v\in K}f(v) > 1$. This result…

We construct a parabolic entire minimal graph $S$ over a finite topology complete Riemannian surface $\Sigma$ of curvature $-1$ and infinite area (thus of non-parabolic conformal type). The vertical projection of this graph yields a…

Let $N$ be a Riemannian manifold and consider a stationary union of three or more $C^{1,\mu}$ hypersurfaces-with-boundary $M_k$ in $N$ with a common boundary $\Gamma$. We show that if $N$ is smooth, then $\Gamma$ is smooth and each $M_k$ is…

Let D be a simple digraph without loops or digons. For any v in V(D) let N_1(v) be the set of all nodes at out-distance 1 from v and let N_2(v) be the set of all nodes at out-distance 2. We provide sufficient conditions under which there…

A graph \textit{G} is a tuple (\textit{V}, \textit{E}), where \textit{V} is the vertex set, \textit{E} is the edge set. A reduced graph is a graph of deleting non-Hamiltonian edges and smoothing out the redundant vertices of degree 2 on an…

Let $G=(V,E)$ be a simple connected graph. A matching of $G$ is a set of disjoint edges of $G$. For every $n, m\in\mathbb{N}$, the $n$-subdivision of $G$ is a simple graph $G^{\frac{1}{n}}$ which is constructed by replacing each edge of $G$…

We consider the geometric evolution problem of entire graphs moving by fractional mean curvature. For this, we study the associated nonlocal quasilinear evolution equation satisfied by the family of graph functions. We establish, using an…

We give a necessary and sufficient graph-theoretic characterization of toric ideals of graphs that are unimodular. As a direct consequence, we provide the structure of unimodular graphs by proving that the incidence matrix of a graph $G$ is…

Graph learning problems are typically approached by focusing on learning the topology of a single graph when signals from all nodes are available. However, many contemporary setups involve multiple related networks and, moreover, it is…

A graph of order $n$ is said to be $k$-\emph{factor-critical} $(0\le k<n)$ if the removal of any $k$ vertices results in a graph with a perfect matching. A $k$-factor-critical graph $G$ is \emph{minimal} if $G-e$ is not $k$-factor-critical…