Related papers: The Edge-Isoperimetric Problem on Sierpinski Graph…
Inspired by a theorem by Skornjakov-Hughes-Pasini [9, 7, 8] and a problem which turned up in our recent paper [13], we start a study of epimorphisms with source a thick generalized m-gon and target a thin generalized m-gon. In this first…
We study a well known noisy model of the graph isomorphism problem. In this model, the goal is to perfectly recover the vertex correspondence between two edge-correlated Erd\H{o}s-R\'{e}nyi random graphs, with an initial seed set of…
We study the problem of estimating the number of edges of an unknown, undirected graph $G=([n],E)$ with access to an independent set oracle. When queried about a subset $S\subseteq [n]$ of vertices the independent set oracle answers whether…
In this paper we are concerned with the problem of finding hypersurfaces of constant curvature and prescribed boundary in the Euclidean space, using the theory of fully nonlinear elliptic equations. We prove that if the given data admits a…
Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…
Let $M$ be a graph manifold such that each piece of its JSJ decomposition has the $\Bbb H^2 \times \Bbb R$ geometry. Assume that the pieces are glued by isometries. Then, there exists a complete Riemannian metric on $\Bbb R \times M$ which…
Let $X=(V,E)$ be a finite simple connected graph with $n$ vertices and $m$ edges. A configuration is an assignment of one of two colors, black or white, to each edge of $X.$ A move applied to a configuration is to select a black edge…
It is well-known that the graph isomorphism problem can be posed as an equivalent problem of determining whether an auxiliary graph structure contains a clique of specific order. However, the algorithms that have been developed so far for…
In the paper we generalize the notion of problem (P) introduced by Poletsky. We introduce the notion of (P_m) extremals. For example, geodesics are (P_1) extremals. Using obtained results we present a description of (P_m) extremals in…
We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a…
This paper is concerned with the convergence of the solution of general elliptic boundary value problems in cylindrical domain, when some directions of the domain go to infinity.
In this paper we study the oriented vertex and arc coloring problem on edge series-parallel digraphs (esp-digraphs) which are related to the well known series-parallel graphs. Series-parallel graphs are graphs with two distinguished…
We study the NP-complete Minimum Shared Edges (MSE) problem. Given an undirected graph, a source and a sink vertex, and two integers p and k, the question is whether there are p paths in the graph connecting the source with the sink and…
Consider a $3$-uniform hypergraph of order $n$ with clique number $k$ such that the intersection of all its $k$-cliques is empty. Szemer\'edi and Petruska proved $n\leq 8m^2+3m$, for fixed $m=n-k$, and they conjectured the sharp bound $n…
In this paper, we deal with a class of semilinear elliptic equation in a bounded domain $\Omega\subset\mathbb{R}^N$, $N\geq 3$, with $C\sp{1,1}$ boundary. Using a new fixed point result of the Krasnoselskii's type for the sum of two…
We derive an a priori real Hessian estimate for solutions of a large family of geometric fully non-linear elliptic equations on compact Hermitian manifolds, which is independent of a lower bound for the right-hand side function. This…
In the work [$\mathcal{O}(m\cdot n)$ algorithms for the recognition and isomorphism problems on circular-arc graphs, SIAM J. Comput. 24(3), 411--439, (1995)], Wen-Lian Hsu claims three results concerning the class of circular-arc graphs: -…
This paper studies the problem of matching two complete graphs with edge weights correlated through latent geometries, extending a recent line of research on random graph matching with independent edge weights to geometric models.…
We prove the existence of classical solutions to the Dirichlet problem for a class of fully nonlinear elliptic equations of curvature type on Riemannian manifolds. We also derive new second derivative boundary estimates which allows us to…
This paper surveys recent analytical and numerical research on linear problems for the integral fractional Laplacian, fractional obstacle problems, and fractional minimal graphs. The emphasis is on the interplay between regularity,…