Related papers: Excluded minors for the Klein Bottle II. Cascades
Let A be a minor-closed class of labelled graphs, and let G_n be a random graph sampled uniformly from the set of n-vertex graphs of A. When n is large, what is the probability that G_n is connected? How many components does it have? How…
In this article, we give the integrability conditions for the existence of an isometric immersion from an orientable simply connected surface having prescribed Gauss map and positive extrinsic curvature into some unimodular Lie groups. In…
We explicitly construct new subgroups of the mapping class groups of an uncountable collection of infinite-type surfaces, including, but not limited to, free groups, Baumslag-Solitar groups, mapping class groups of other surfaces, and a…
We present conditions on the Ricci curvature for complete, oriented, minimal submanifolds of Euclidean space, as well as the standard unit sphere, when the Gauss maps are bounded embeddings.
Entangled embedded periodic nets and crystal frameworks are defined, along with their dimension type, homogeneity type, adjacency depth and periodic isotopy type. We obtain periodic isotopy classifications for various families of embedded…
A {\em rooted graph} is a graph together with a designated vertex subset, called the {\em roots}. In this paper, we consider rooted graphs embedded in a fixed surface. A collection of faces of the embedding is a {\em face cover} if every…
Graph embedding is a powerful method in parallel computing that maps a guest network $G$ into a host network $H$. The performance of an embedding can be evaluated by certain parameters, such as the dilation, the edge congestion and the…
We prove that the class of 3D-grids is cannot be transduced from planar graphs, and more generally, from any class of graphs of bounded Euler genus. To prove our result, we introduce a new structural tool called slice decompositions, and…
An locally conformally Kahler (LCK) manifold with potential is a complex manifold with a cover which admits an automorphic Kahler potential. An LCK manifold with potential can be embedded to a Hopf manifold, if its dimension is at least 3.…
We consider $(1,1)$-surfaces, namely, minimal compact complex surfaces $S$ with $p_g (S) =K_S^2=1$: for these the bicanonical map is a covering of degree $4$ of the plane $\mathbb{P}^2$. And we answer a question posed by Meng Chen, whether…
In the study of full bubble model graphs of bounded clique-width and bounded linear clique-width, we determined complete sets of forbidden induced subgraphs, that are minimal in the class of full bubble model graphs. In this note, we show…
We construct compact arbitrary Euler characteristic orientable and non-orientable minimal surfaces in the Berger spheres. Besides we show an interesting family of surfaces that are minimal in every Berger sphere, characterizing them by this…
If $X$ is a compact set, a {\it topological contraction} is a self-embedding $f$ such that the intersection of the successive images $f^k(X)$, $k>0$, consists of one point. In dimension 3, we prove that there are smooth topological…
Minimal prime graphs are connected graphs on at least two vertices whose complements satisfy the following conditions: triangle-freeness, 3-colorability, and edge-maximality with respect to the latter two properties. These graphs are prime…
We describe a construction for embeddings of complete graphs where the dual has a cutvertex and the genus is close to the minimum genus of the primal graph. When the number of vertices is congruent to 5 modulo 12, we further guarantee that…
A graph coloring has bounded clustering if each monochromatic component has bounded size. This paper studies such a coloring, where the number of colors depends on an excluded complete bipartite subgraph. This is a much weaker assumption…
A graph G is weakly 4-connected if it is 3-connected, has at least five vertices, and for every pair of sets (A,B) with union V(G) and intersection of size three such that no edge has one end in A-B and the other in B-A, one of the induced…
The Bandwidth Theorem of B\"ottcher, Schacht and Taraz [Mathematische Annalen 343 (1), 175-205] gives minimum degree conditions for the containment of spanning graphs H with small bandwidth and bounded maximum degree. We generalise this…
Gross derived an $O(n^2)$-time algorithm to calculate the genus distribution of a given cubic Halin graph. In this paper, with the help of overlap matrix, we get a recurrence relation for the Euler-genus polynomial of cubic…
We develop a theory of confluence of graphs. We describe an algorithm for proving that a given system of reduction rules for abstract graphs and graphs in surfaces is locally confluent. We apply this algorithm to show that each simple Lie…