相关论文: On approximability by embeddings of cycles in the …
We show that c-planarity is solvable in quadratic time for flat clustered graphs with three clusters if the combinatorial embedding of the underlying graph is fixed. In simpler graph-theoretical terms our result can be viewed as follows.…
We prove that given a planar embedding of a graph in the sphere the expansion of the graph structure by predicates encoding separation of vertices by simple cycles of the graph is dp-minimal.
A pseudocircle is a simple closed curve on some surface; an arrangement of pseudocircles is a collection of pseudocircles that pairwise intersect in exactly two points, at which they cross. Ortner proved that an arrangement of pseudocircles…
Given a positive integer $p$, we consider $W^{1,p}$-maps from a Euclidean domain of dimension $p+1$ into a closed Riemannian manifold $\mathcal{N}$. The target manifold is required to satisfy suitable topological conditions; in particular,…
We develop a new purely combinatorial approach to N. Steenrod's problem on realisation of cycles. We prove that every n-dimensional homology class of every topological space can be realised with some multiplicity by an image of a…
We extend the Tian approximation theorem for projective manifolds to a class of complex non-K\"ahler manifolds, the so-called Vaisman manifolds. More precisely, we study the problem of approximating compact regular, respectively…
This paper studies the properties of convergence of distances between points and the existence and uniqueness of best proximity and fixed points of the so-called semi-cyclic impulsive self-mappings on the union of a number of nonempty…
This paper studies the obstructions to deforming a map from a complex variety to another variety which is an immersion of codimension one. We extend the classical notion of semiregularity of subvarieties to maps between varieties, and show…
We consider sufficient conditions for the existence of $k$-th powers of Hamiltonian cycles in $n$-vertex graphs $G$ with minimum degree $\mu n$ for arbitrarily small $\mu>0$. About 20 years ago Koml\'os, Sark\"ozy, and Szemer\'edi resolved…
Given a collection of planar graphs $G_1,\dots,G_k$ on the same set $V$ of $n$ vertices, the simultaneous geometric embedding (with mapping) problem, or simply $k$-SGE, is to find a set $P$ of $n$ points in the plane and a bijection $\phi:…
Given a finite set $ S $ of points, we consider the following reconfiguration graph. The vertices are the plane spanning paths of $ S $ and there is an edge between two vertices if the two corresponding paths differ by two edges (one…
In this paper we give results about projective embeddings of Riemann surfaces, smooth or nodal, which we apply to the inverse Dirichlet-to-Neumann problem and to the inversion of a Riemann-Klein theorem. To produce useful embeddings, we…
We have recently introduced the trimming property for a complete Riemannian manifold $N^{n}$ as a necessary and sufficient condition for bounded maps to be strongly dense in $W^{1, p}(B^m; N^{n})$ when $p \in \{1, \dotsc, m\}$. We prove in…
We give a necessary and sufficient condition for the mapping class group of the pair of the 3-sphere and a graph embedded in it to be isomorphic to the topological symmetry group of the embedded graph.
An arrangement of pseudocircles is a finite set of oriented closed Jordan curves each two of which cross each other in exactly two points. To describe the combinatorial structure of arrangements on closed orientable surfaces, in (Linhart,…
We define and study embeddings of cycles in finite affine and projective planes. We show that for all $k$, $3\le k\le q^2$, a $k$-cycle can be embedded in any affine plane of order $q$. We also prove a similar result for finite projective…
Let S^n be the standard n-sphere embedded in R^{n+1}. A mapping T: S^n \to S^n, not assumed continuous or even measurable, nor injective, is called weakly circle-preserving if the image of any circle under T is contained in some circle in…
We provide an optimal sufficient condition, relating minimum degree and bandwidth, for a graph to contain a spanning subdivision of the complete bipartite graph $K_{2,\ell}$. This includes the containment of Hamilton paths and cycles, and…
Let X be a plane in a torus over an algebraically closed field K, with tropicalization the matroidal fan Sigma. In this paper we present an algorithm which completely solves the question whether a given one-dimensional balanced polyhedral…
We give an algorithm for approximating a given plane curve segment by a planar elastic curve. The method depends on an analytic representation of the space of elastic curve segments, together with a geometric method for obtaining a good…