Related papers: Checkerboard embeddings of *-graphs into nonorient…
The work provides a brief intuitive overview theory of graph on surfaces. We considers graphs with an additional structure, wich we call discs with ribbons, also known as one-vertex ribbon graphs. And solves the problem (Skopenkov's) about…
We investigate the property of a spatial graph of having a leveled embedding and characterize the abstract graphs with this property. We show that all leveled embeddings are free and we compare leveled and paneled (also known as flat)…
The present paper is the first one in the sequence of papers about a simple class of {\em framed $4$-graphs}; the goal of the present paper is to collect some well-known results on planarity and to reformulate them in the language of {\em…
We introduce a homology theory for k-graphs and explore its fundamental properties. We establish connections with algebraic topology by showing that the homology of a k-graph coincides with the homology of its topological realisation as…
A graph embedded in a surface with all faces of size 4 is known as a quadrangulation. We extend the definition of quadrangulation to higher dimensions, and prove that any graph G which embeds as a quadrangulation in the real projective…
We give a complete classification of hexagonal tilings and locally C6 graphs, by showing that each of them has a natural embedding in the torus or in the Klein bottle. We also show that locally grid graphs are minors of hexagonal tilings…
The paper is devoted to relations between topological and metric properties of germs of real surfaces, obtained by analytic maps from $R^2$ to $R^4$. We show that for a big class of such surfaces the normal embedding property implies the…
The aim of this work is to adapt the complex analytic methods originating in modern Oka theory to the study of non-orientable conformal minimal surfaces in $\mathbb{R}^n$ for any $n\ge 3$. These methods, which we develop essentially from…
For $p,q\ge2$ the $\{p,q\}$-tiling graph is the (finite or infinite) planar graph $T_{p,q}$ where all faces are cycles of length $p$ and all vertices have degree $q$. We give algorithms for the problem of recognizing (induced) subgraphs of…
Simplicial surfaces describe the incidence relations between vertices, edges and faces of triangulated 2-dimensional manifolds in a purely combinatorial way. By considering only the incidences of edges and faces, simplicial surfaces are…
A closed algebraic embedding of $\mathbb{C}^*=\mathbb{C}^1\setminus\{0\}$ into $\mathbb{C}^2$ is 'sporadic' if for every curve $A\subseteq \mathbb{C}^2$ isomorphic to an affine line the intersection with $\mathbb{C}^*$ is at least $2$.…
We consider relations between the size, treewidth, and local crossing number (maximum number of crossings per edge) of graphs embedded on topological surfaces. We show that an $n$-vertex graph embedded on a surface of genus $g$ with at most…
The choosability $\chi_\ell(G)$ of a graph $G$ is the minimum $k$ such that having $k$ colors available at each vertex guarantees a proper coloring. Given a toroidal graph $G$, it is known that $\chi_\ell(G)\leq 7$, and $\chi_\ell(G)=7$ if…
The problem of map enumeration concerns counting connected spatial graphs, with a specified number $j$ of vertices, that can be embedded in a compact surface of genus $g$ in such a way that its complement yields a cellular decomposition of…
In this paper, we make use of the relations between the braid and mapping class groups of a compact, connected, non-orientable surface N without boundary and those of its orientable double covering S to study embeddings of these groups and…
The weak minor G of a graph G is the graph obtained from G by a sequence of edge-contraction operations on G. A weak-minor-closed family of upper embeddable graphs is a set G of upper embeddable graphs that for each graph G in G, every weak…
We prove that every graph $G$ on $n$ vertices with no isolated vertices contains an induced subgraph of size at least $n/10000$ with all degrees odd. This solves an old and well-known conjecture in graph theory.
This paper proves that classical minimal surfaces of arbitrary topological type with total boundary curvature at most 4\pi must be smoothly embedded. Related results are proved for varifolds and for soap film surfaces.
The maximum number of vertices in a graph of maximum degree $\Delta\ge 3$ and fixed diameter $k\ge 2$ is upper bounded by $(1+o(1))(\Delta-1)^{k}$. If we restrict our graphs to certain classes, better upper bounds are known. For instance,…
Let X be a simply-connected closed oriented 4-manifold and A an embedded surface of genus g and negative self-intersection -N. We show that for fixed genus g there is an upper bound on N if the homology class of A is divisible or…