Related papers: The stickiness property for antisymmetric nonlocal…

We prove that nonlocal minimal graphs in the plane exhibit generically stickiness effects and boundary discontinuities. More precisely, we show that if a nonlocal minimal graph in a slab is continuous up to the boundary, then arbitrarily…

In this note, we showcase some recent results concerning the stickiness properties of nonlocal minimal graphs in the plane. To start with, the nonlocal minimal graphs in the plane enjoy an enhanced boundary regularity, since boundary…

In this paper, we introduce a functional and a geometric setting for an obstacle problem for nonlocal minimal graphs. In particular we study existence of solutions, a priori estimates, and we prove the equivalence of the two settings. We…

We consider the behavior of the nonlocal minimal surfaces in the vicinity of the boundary. By a series of detailed examples, we show that nonlocal minimal surfaces may stick at the boundary of the domain, even when the domain is smooth and…

In this article we have derived the minimum order of an odd regular graph such that the graph has no matching. We have observed that how it is different from the case of even regular graphs. We have checked the consistency of the derived…

We prove that the trace of nonlocal minimal graphs at points of stickiness is of class~$C^{1,\gamma}$. As a result, we show that boundary continuity implies boundary differentiability for nonlocal minimal graphs.

We consider nonlocal minimal surfaces in a cylinder with prescribed datum given by the complement of a slab. We show that when the width of the slab is large the minimizers are disconnected and when the width of the slab is small the…

We introduce a curvature function for planar graphs to study the connection between the curvature and the geometric and spectral properties of the graph. We show that non-positive curvature implies that the graph is infinite and locally…

A $k$-graph $\mathcal{G}$ is asymmetric if there does not exist an automorphism on $\mathcal{G}$ other than the identity, and $\mathcal{G}$ is called minimal asymmetric if it is asymmetric but every non-trivial induced sub-hypergraph of…

We study vulnerability of a uniformly distributed random graph to an attack by an adversary who aims for a global change of the distribution while being able to make only a local change in the graph. We call a graph property $A$…

We develop a functional analytic approach for the study of nonlocal minimal graphs. Through this, we establish existence and uniqueness results, a priori estimates, comparison principles, rearrangement inequalities, and the equivalence of…

An asymmetric coloring of a graph is a coloring of its vertices that is not preserved by any non-identity automorphism of the graph. The motion of a graph is the minimal degree of its automorphism group, i.e., the minimum number of elements…

This paper is devoted to the study of tilt stability in finite dimensional optimization via the approach of using the subgradient graphical derivative. We establish a new characterization of tilt-stable local minimizers for a broad class of…

We consider the nonlinear problem \[(P) \;\; I u=f(x,u) \text{ in $\Omega$,} \;\; u=0 \text{ on $\mathbb{R}^{N}\setminus\Omega$ }\] in an open bounded set $\Omega\subset\mathbb{R}^{N}$, where $I$ is a nonlocal operator which may be…

We call a finite undirected graph minimally k-matchable if it has at least k distinct perfect matchings but deleting any edge results in a graph which has not. An odd subdivision of some graph G is any graph obtained by replacing every edge…

Many important results in extremal graph theory can be roughly summarised as "if a triangle-free graph $G$ has certain properties, then it has a homomorphism to a triangle-free graph $\Gamma$ of bounded size". For example, bounds on…

We prove the removable singularity theorem for nonlocal minimal graphs. Specifically, we show that any nonlocal minimal graph in $\Omega \setminus K$, where $\Omega \subset \mathbb{R}^n$ is an open set and $K \subset \Omega$ is a compact…

In previous papers, threshold probabilities for the properties of a random distance graph to contain strictly balanced graphs were found. We extend this result to arbitrary graphs and prove that the number of copies of a strictly balanced…

We revisit the concept of minimal rigidity as applied to soft repulsive, frictionless sphere packings in two-dimensions with the introduction of the jamming graph. Minimal rigidity is a purely combinatorial property encoded via Laman's…

It is well-known that a minimal graph of codimension one is stable, i.e. the second variation of the area functional is non-negative. This is no longer true for higher codimensional minimal graphs. In this note, we prove that a minimal…