Related papers: A generalization of Rado's Theorem for almost grap…

We derive an upper bound on the size of a ball such that the image of the ball under quadratic map is strongly convex and smooth. Our result is the best possible improvement of the analogous result by Polyak in the case of quadratic map. We…

An integer partition is called graphical if it is the degree sequence of a simple graph. We prove that the probability that a uniformly chosen partition of size $n$ is graphical decreases to zero faster than $n^{-.003}$, answering a…

Let $H$, $T$ and $C_n$ be a graph, a tree and a cycle of order $n$, respectively. Let $H^{(i)}$ be the complete join of $H$ and an empty graph on $i$ vertices. Then the Cartesian product $H\Box T$ of $H$ and $T$ can be obtained by applying…

The bidimensionality of a set of vertices $X$ in a graph $G$ is the maximum $k$ for which $G$ contains as a $X$-rooted minor the $(k \times k)$-grid. This notion allows for the following version of the Graph Minors Structure Theorem (GMST)…

For graphs $G,H$ it is possible to add $(|V(G)|-\gamma(G))(|V(H)|-\gamma(H))$ edges to the Cartesian product $G\mathbin{\square}H$ such that a minimal dominating set $D$ of size $\gamma(G)\gamma(H)$ emerges. We hypothesize that $D$ is also…

We give upper bounds on the genus of a curve with general moduli assuming that it can be embedded in a projective nonsingular surface $Y$ so that $\dim(|C|) > 0$. We find such bounds for all types of surfaces of intermediate Kodaira…

In communication field, an important issue is to group users and base stations to as many as possible subnetworks satisfying certain interference constraints. These problems are usually formulated as a graph partition problems which…

Minimal surfaces and domain walls play important roles in various contexts of spacetime physics as well as material science. In this paper, we first review the Bernstein conjecture, which asserts that a plane is the only globally well…

In this note we discuss graphs over a domain $\Omega\subset N^2$ in the product manifold $N^2\times \mathbb{R}$. Here $N^2$ is a complete Riemannian surface and $\Omega$ has peice-wise smooth boundary. Let $\gamma \subset\partial\Omega$ be…

The aim of this paper is twofold. First, we cut off a part of a convex surface by a plane near a ridge point and characterize the limiting behavior of the surface measure in $S^2$ induced by this part of surface when the plane approaches…

We classify entire 2-dimensional area-minimizing or stable surfaces in R^4 with quadratic area growth as algebraic, cut out by a finite union of holomorphic polynomials whose collective degrees are controlled by the density at infinity. As…

In this article we discuss classical theorems from Convex Geometry in the context of topological drawings and beyond. In a simple topological drawing of the complete graph $K_n$, any two edges share at most one point: either a common vertex…

We study the algorithmic problem of computing drawings of graphs in which $(i)$ each vertex is a disk with fixed radius $\rho$, $(ii)$ each edge is a straight-line segment connecting the centers of the two disks representing its…

We prove that a minimal disc in a CAT(0) space is a local embedding away from a finite set of "branch points". On the way we establish several basic properties of minimal surfaces: monotonicity of area densities, density bounds, limit…

In this article we prove that all boundary points of a minimal oriented hypersurface in a Riemannian manifold are regular, that is, in a neighborhood of any boundary point, the minimal surface is a $\mathcal{C}^{1, \frac14}$ submanifold…

A surface with boundary is randomly generated by gluing polygons along some of their sides. We show that its genus and number of boundary components asymptotically follow a bivariate normal distribution.

Parallel transport, or path development, provides a rich characterization of paths which preserves the underlying algebraic structure of concatenation. The path signature is universal among such maps: any (translation-invariant) parallel…

A question whether sufficiently regular manifold automorphisms may have wandering domains with controlled geometry is answered in the negative for quasiconformal or smooth homeomorphisms of $n$-tori, $n\ge2$, and hyperbolic surfaces.…

The theory of graph limits is only understood to any nontrivial degree in the cases of dense graphs and of bounded degree graphs. There is, however, a lot of interest in the intermediate cases. It appears that the most important…

Let $\mathcal{D}_k$ be the class of graphs for which every minor has minimum degree at most $k$. Then $\mathcal{D}_k$ is closed under taking minors. By the Robertson-Seymour graph minor theorem, $\mathcal{D}_k$ is characterised by a finite…