Related papers: The complexity of orientable graph manifolds
By means of a slight modification of the notion of GM-complexity, the present paper performs a graph-theoretical approach to the computation of (Matveev's) complexity for closed orientable 3-manifolds. In particular, the existing…
We give a summary of known results on Matveev's complexity of compact 3-manifolds. The only relevant new result is the classification of all closed orientable irreducible 3-manifolds of complexity 10.
We compute for all orientable irreducible geometric 3-manifolds certain complexity functions that approximate from above Matveev's natural complexity, known to be equal to the minimal number of tetrahedra in a triangulation. We can show…
The graph complexity of a compact 3-manifold is defined as the minimum order among all 4-colored graphs representing it. Exact calculations of graph complexity have been already performed, through tabulations, for closed orientable…
We deal with Matveev complexity of compact orientable 3-manifolds represented via Heegaard diagrams. This lead us to the definition of modified Heegaard complexity of Heegaard diagrams and of manifolds. We define a class of manifolds which…
We describe an algorithm which has enabled us to give a complete list, without repetitions, of all closed oriented irreducible 3-manifolds of complexity up to 9. More interestingly, we have actually been able to give a "name" to each such…
We extend Matveev's theory of complexity for 3-manifolds, based on simple spines, to (closed, orientable, locally orientable) 3-orbifolds. We prove naturality and finiteness for irreducible 3-orbifolds, and, with certain restrictions and…
After a short summary of known results on surface-complexity of closed 3-manifolds, we will classify all closed orientable 3-manifolds with surface-complexity one.
We give upper bounds of the Matveev complexities of two-bridge link complements by constructing their spines explicitly. In particular, we determine the complexities for an infinite sequence of two-bridge links corresponding to the…
We extend Matveev's complexity of 3-manifolds to PL compact manifolds of arbitrary dimension, and we study its properties. The complexity of a manifold is the minimum number of vertices in a simple spine. We study how this quantity changes…
We give an upper bound on the number of perfect matchings in an undirected simple graph $G$ with an even number of vertices, in terms of the degrees of all the vertices in $G$. This bound is sharp if $G$ is a union of complete bipartite…
We consider the problem of determining the inducibility (maximum possible asymptotic density of induced copies) of oriented graphs on four vertices. We provide exact values for more than half of the graphs, and very close lower and upper…
The idea of computing Matveev complexity by using Heegaard decompositions has been recently developed by two different approaches: the first one for closed 3-manifolds via crystallization theory, yielding the notion of Gem-Matveev…
We study the set of all closed oriented smooth 4-manifolds experimentally, according to a suitable complexity defined using Turaev's shadows. This complexity roughly measures how complicated the 2-skeleton of the 4-manifold is. We…
We consider closed orientable 3-dimensional hyperbolic manifolds which are cyclic branched coverings of the 3-sphere, with branching set being a two-bridge knot (or link). We establish two-sided linear bounds depending on the order of the…
The notion of Gem-Matveev complexity has been introduced within crystallization theory, as a combinatorial method to estimate Matveev's complexity of closed 3-manifolds; it yielded upper bounds for interesting classes of such manifolds. In…
A graph $G$ is primarily orientable if it is possible to orient its edges in such a way that the resulting oriented graph is prime, i.e., indecomposable under modular decomposition. We characterize primarily orientable graphs.
Within crystallization theory, (Matveev's) complexity of a 3-manifold can be estimated by means of the combinatorial notion of GM-complexity. In this paper, we prove that the GM-complexity of any lens space L(p,q), with p greater than 2, is…
We study closed orientable manifolds whose topological complexity is at most 3 and determine their cohomology rings. For some of admissible cohomology rings we are also able to identify corresponding manifolds up to homeomorphism.
A labeled oriented graph (LOG) is an oriented graph with a labeling function from the edge set into the vertex set. The complexity of a LOG is the minimal cardinality of an initial set $S$ of vertices such that every vertex can be reached…