Related papers: Uniqueness of exterior differentiation on locally …
A graph is called primitive if its automorphism group acts primitively on the vertex set. In this paper, we prove a classification of the possible distance sequences of locally infinite primitive graphs. In particular we show that if a…
Bounds on the minimum degree and on the number of vertices at- taining it have been much studied for finite edge-/vertex-minimally k- connected/k-edge-connected graphs. We give an overview of the results known for finite graphs, and show…
On the simultaneous edge coloring of graphs
A matching in a graph is uniquely restricted if no other matching covers exactly the same set of vertices. We establish tight lower bounds on the maximum size of a uniquely restricted matching in terms of order, size, and maximum degree.
We give a brief survey of some known results on intrinsically linked or knotted graphs.
A property of finite graphs is called nondeterministically testable if it has a "certificate" such that once the certificate is specified, its correctness can be verified by random local testing. In this paper we study certificates that…
The distinguishing number $D(G)$ of a graph $G$ is the smallest number of colors that is needed to color the vertices of $G$ such that the only color preserving automorphism is the identity. For infinite graphs $D(G)$ is bounded by the…
The main goal of this article is to understand the trace properties of nonlocal minimal graphs in~$\R^3$, i.e. nonlocal minimal surfaces with a graphical structure. We establish that at any boundary points at which the trace from inside…
We study the physical Laplacian and the corresponding heat flow on an infinite, locally finite graph with possibly unbounded valence.
We study some semi-linear equations for the $(m,p)$-Laplacian operator on locally finite weighted graphs. We prove existence of weak solutions for all $m\in\mathbb{N}$ and $p\in(1,+\infty)$ via a variational method already known in the…
The Divisibility Graph of a finite group $G$ has vertex set the set of conjugacy class lengths of non-central elements in $G$ and two vertices are connected by an edge if one divides the other. We determine the connected components of the…
In this paper, as the second in our series of papers on differential geometry of microlinear Frolicher spaces, we study differenital forms. The principal result is that the exterior differentiation is uniquely determined geometrically, just…
In this article, the distance magic index of certain important classes of partite graphs are determined.
In this paper we study the uniqueness of graphical mean curvature flow. We consider as initial conditions graphs of locally Lipschitz functions and prove that in the one dimensional case solutions are unique without any further assumptions.…
We obtain a lower bound on each entry of the principal eigenvector of a non-regular connected graph.
I prove a local finite determinacy result of singular fibres in families. As an application, I generalize finite determinacy results on the fibres of log morphisms and nearby and vanishing cycles sheaves by Illusie and Kisin.
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…
We study continuous maps between differential manifolds from a microlocal point of view. In particular, we characterize the Lipschitz continuity of these maps in terms of the microsupport of the constant sheaf on their graph. Furthermore,…
A proper vertex coloring of a graph is said to be locally identifying if the sets of colors in the closed neighborhood of any two adjacent non-twin vertices are distinct. The lid-chromatic number of a graph is the minimum number of colors…
For a flexible labeling of a graph, it is possible to construct infinitely many non-equivalent realizations keeping the distances of connected points constant. We give a combinatorial characterization of graphs that have flexible labelings.…