Related papers: Constrained variational problems on perturbed latt…
As a simple model for lattice defects like grain boundaries in solid state physics we consider potentials which are obtained from a periodic potential $V = V(x,y)$ on $\R^2$ with period lattice $\Z^2$ by setting $W_t(x,y) = V(x+t,y)$ for $x…
We suggest a new formulation of the inverse spectral problem for second-order functional-differential operators on star-shaped graphs with global delay. The latter means that the delay, being measured in the direction to a specific boundary…
We look for ground state solutions to the Schr\"odinger-type system \[ \begin{cases} -\Delta u_j + \lambda_j u_j = \partial_jF(u)\\ \int_{\rn} u_j^2 \, dx = a_j^2\\ (\lambda_j,u_j) \in \mathbb{R} \times H^1(\mathbb{R}^N) \end{cases} j \in…
This work establishes rigorous, novel and widely applicable stability guarantees and transferability bounds for graph convolutional networks -- without reference to any underlying limit object or statistical distribution. Crucially,…
In a graph $G=(V,E)$ with no isolated vertex, a dominating set $D \subseteq V$, is called a semitotal dominating set if for every vertex $u \in D$ there is another vertex $v \in D$, such that distance between $u$ and $v$ is at most two in…
For a graph $G$, let $t(G)$ denote the maximum number of vertices in an induced subgraph of $G$ that is a tree. Further, for a vertex $v\in V(G)$, let $t^v(G)$ denote the maximum number of vertices in an induced subgraph of $G$ that is a…
We study the uniqueness of optimal solutions to extremal graph theory problems. Lovasz conjectured that every finite feasible set of subgraph density constraints can be extended further by a finite set of density constraints so that the…
This paper considers an edge minimization problem in saturated bipartite graphs. An $n$ by $n$ bipartite graph $G$ is $H$-saturated if $G$ does not contain a subgraph isomorphic to $H$ but adding any missing edge to $G$ creates a copy of…
We consider PT-symmetric, nonlocal nonlinear Schrodinger equation on metric graphs. Vertex boundary conditions are derived from the conservation laws. Soliton solutions are obtained for simplest graph topologies, such as star and tree…
A graph is color-critical if it contains an edge whose deletion reduces its chromatic number. This class of graphs, including cliques and odd cycles, plays a central role in extremal graph theory. In this paper, following an influential…
The Tur\'{a}n number of a graph $H$, $\text{ex}(n,H)$, is the maximum number of edges in an $n$-vertex graph that does not contain $H$ as a subgraph. For a vertex $v$ and a multi-set $\mathcal{F}$ of graphs, the suspension $\mathcal{F}+v$…
We consider variational inequality solutions with prescribed gradient constraints for first order linear boundary value problems. For operators with coefficients only in $L^2$, we show the existence and uniqueness of the solution by using a…
We investigate the existence and the singular limit of normalized ground states for focusing doubly nonlinear Schr\"odinger equations with both standard and concentrated nonlinearities on two-dimensional square grids. First, we provide…
In this paper, we first develop the theory of Musielak-Orlicz spaces on locally finite graphs, including completeness, reflexivity, separability, and so on. Then, we give some elementary properties of double phase operators on locally…
Generalized Tur\'an problems have been a central topic of study in extremal combinatorics throughout the last few decades. One such problem is maximizing the number of cliques of size $t$ in a graph of a fixed order that does not contain…
We prove essentially tight lower bounds, conditionally to the Exponential Time Hypothesis, for two fundamental but seemingly very different cutting problems on surface-embedded graphs: the Shortest Cut Graph problem and the Multiway Cut…
We are concerned with a stochastic mean curvature flow of graphs over a periodic domain of any space dimension. We establish existence of martingale solutions which are strong in the PDE sense and study their large-time behavior. Our…
Perturbed graphic matroids are binary matroids that can be obtained from a graphic matroid by adding a noise of small rank. More precisely, r-rank perturbed graphic matroid M is a binary matroid that can be represented in the form I +P,…
{\sc Vertex $(s, t)$-Cut} and {\sc Vertex Multiway Cut} are two fundamental graph separation problems in algorithmic graph theory. We study matroidal generalizations of these problems, where in addition to the usual input, we are given a…
Graph-modification problems, where we modify a graph by adding or deleting vertices or edges or contracting edges to obtain a graph in a {\it simpler} class, is a well-studied optimization problem in all algorithmic paradigms including…