Related papers: Vertex-Minimal Paper Tori
In this paper we give a geometric characterization of the cones of toric varieties that are complete intersections. In particular, we prove that the class of complete intersection cones is the smallest class of cones which is closed under…
A graph is an apex graph if it contains a vertex whose deletion leaves a planar graph. The family of apex graphs is minor-closed and so it is characterized by a finite list of minor-minimal non-members. The long-standing problem of…
An embedding of a graph in a book, called book embedding, consists of a linear ordering of its vertices along the spine of the book and an assignment of its edges to the pages of the book, so that no two edges on the same page cross. The…
Those maps of a closed surface to the three-dimensional torus that are homotopic to embeddings are characterized. Particular attention is paid to the somewhat intricate case when the surface is nonorientable.
There are two particular $\Theta_6$-graphs - the 6-cycle graphs with a diagonal. We find the planar Tur\'an number of each of them, i.e. the maximum number of edges in a planar graph $G$ of $n$ vertices not containing the given $\Theta_6$…
Suppose that $G$ is a simple, vertex-labeled graph and that $S$ is a multiset. Then if there exists a one-to-one mapping between the elements of $S$ and the vertices of $G$, such that edges in $G$ exist if and only if the absolute…
The degree of a map between orientable manifolds is a fundamental concept in topology, offering deep insights into the structure of the manifolds and the nature of the corresponding maps. This concept has been extensively studied,…
Twist tori are examples of exotic monotone lagrangian tori, presented in [1]. This tree of examples grew up over the first one --- the torus $\Theta \in \R^4$, constructured in [2] and [3]. On the other hand, in [4] and [5] we proposed a…
We find the minimal number of links in an embedding of any complete $k$-partite graph on 7 vertices (including $K_7$, which has at least 21 links). We give either exact values or upper and lower bounds for the minimal number of links for…
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…
We construct toric manifolds of complex dimension $\geq 4$, whose orbit spaces by the action of the compact torus are not homeomorphic to simple polytopes (as manifolds with corners). These provide the first known examples of toric…
We give explicit origami embeddings of a 2-dimensional flat torus of any modulus in the 3-dimensional Euclidean space.
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by no more than one other edge (and any pair of crossing edges cross only once). A non-1-planar graph $G$ is minimal if the graph $G-e$ is 1-planar for every…
A graph $G$ is called a pairwise compatibility graph (PCG) if there exists an edge-weighted tree $T$ and two non-negative real numbers $d_{min}$ and $d_{max}$ such that each leaf $l_u$ of $T$ corresponds to a vertex $u \in V$ and there is…
A map from a manifold to a Euclidean space is said to be k-regular if the image of any distinct k points are linearly independent. In this paper, we give some lower bounds of the dimension of the ambient Euclidean space for complex…
In this article we give a new proof for the infinitesimal Torelli theorem for minimal elliptic surfaces without multiple fibers with Euler number at least 24 for nonconstant $j$-invariant. In the case of constant $j$-invariant we find a new…
In this paper, we disprove a conjecture recently proposed in [L. Almodovar et al., arXiv:2108.00035] on the non-existence of biminimal pots realizing the cube, namely pots with the minimum number of tiles and the minimum number of bond-edge…
A matching of a graph is a set of edges without common end vertex. A graph is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. Recently, Biedl and Wittnebel proved that every 1-planar graph…
Minimum numbers of fixed points or of coincidence components (realized by maps in given homotopy classes) are the principal objects of study in topological fixed point and coincidence theory. In this paper we investigate fiberwise analoga…
If a graph can be drawn on the torus so that every two independent edges cross an even number of times, then the graph can be embedded on the torus.