相关论文: Face pairing graphs and 3-manifold enumeration

We observe that certain large-clique graph triangulations can be useful to reduce both computational and space requirements when making queries on mixed stochastic/deterministic graphical models. We demonstrate that many of these…

We discuss different approaches for the enumeration of triangulated surfaces. In particular, we enumerate all triangulated surfaces with 9 and 10 vertices. We also show how geometric realizations of orientable surfaces with few vertices can…

For a compact, irreducible, $\partial$-irreducible, an-annular bounded 3-manifold $M\ne\mathbb{B}^3$, then any triangulation $\mathcal{T}$ of $M$ can be modified to an ideal triangulation $\mathcal{T}^*$ of $\stackrel{\circ}{M}$. We use the…

The triangulation complexity of a closed orientable 3-manifold is the minimal number of tetrahedra in any triangulation of the manifold. The main theorem of the paper gives upper and lower bounds on the triangulation complexity of any…

Gems are a particular type of edge-colored graphs, dual to colored triangulations, which represent compact PL-manifolds of arbitrary dimension, both in the closed and boundary case. In the present paper, gem theory is used to approach…

We demonstrate how a 3-manifold, a Heegaard diagram, and a group presentation can each be interpreted as a pair of signed permutations in the symmetric group $S_d.$ We demonstrate the power of permutation data in programming and discuss an…

We study simplices with equiareal faces in the Euclidean 3-space by means of elementary geometry. We present an unexpectedly simple proof of the fact that, if such a simplex is non-degenerate, than every two of its faces are congruent. We…

We prove that every locally Hamiltonian graph with $n\ge 3$ vertices and possibly with multiple edges has at least $3n-6$ edges with equality if and only if it triangulates the sphere. As a consequence, every edge-maximal embedding of a…

In graph theory, as well as in 3-manifold topology, there exist several width-type parameters to describe how "simple" or "thin" a given graph or 3-manifold is. These parameters, such as pathwidth or treewidth for graphs, or the concept of…

The optimal calculation order of a computational graph can be represented by a set of algebraic expressions. Computational graph and algebraic expression both have close relations and significant differences, this paper looks into these…

Let $\mathscr{O}(P)$ and $\mathscr{C}(P)$ denote the order polytope and chain polytope, respectively, associated with a finite poset $P$. We prove the following result: if $P$ is a maximal ranked poset, then the number of triangular…

We study triangle decompositions of graphs. We consider constructions of classes of graphs where every edge lies on a triangle and the addition of the minimum number of multiple edges between already adjacent vertices results in a strongly…

We prove that for every closed, connected, orientable, irreducible 3-manifold, there exists an alternating group A_n which is not the topological symmetry group of any graph embedded in the manifold. We also show that for every finite group…

A k-outerplanar graph is a graph that can be drawn in the plane without crossing such that after k-fold removal of the vertices on the outer-face there are no vertices left. In this paper, we study how to triangulate a k-outerplanar graph…

Barnette's conjecture states that every cubic, bipartite, planar and 3-connected graph is Hamiltonian. Goodey verified Barnette's conjecture for all graphs with faces of size up to 6. We substantially strengthen Goodey's result by proving…

We show that a closed orientable 3--dimensional manifold admits a round fold map into the plane, i.e. a fold map whose critical value set consists of disjoint simple closed curves isotopic to concentric circles, if and only if it is a graph…

We give a density condition for when, subject to a necessary parity condition, an eulerian graph or digraph may be cellularly embedded in an orientable surface so that it has exactly two faces, each bounded by an euler circuit, one of which…

We classify the $3$-manifolds obtained as the preimages of arcs on the plane for simplified $(2, 0)$-trisection maps, which we call vertical $3$-manifolds. Such a $3$-manifold is a connected sum of a $6$-tuple of vertical $3$-manifolds over…

A tetrahedral curve is a (usually nonreduced) curve in P^3 defined by an unmixed, height two ideal generated by monomials. We characterize when these curves are arithmetically Cohen-Macaulay by associating a graph to each curve and, using…

Representations of planar triangulations as contact graphs of a set of internally disjoint homothetic triangles or of a set of internally disjoint homothetic squares have received quite some attention in recent years. In this paper we…