Infinitely many hypermaps of a given type and genus.
Jones, Gareth A., Pinto, Daniel (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Jones, Gareth A., Pinto, Daniel (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Plummer, Michael D., Zha, Xiaoya (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Sandro Manfredini (2003)
Annali della Scuola Normale Superiore di Pisa - Classe di Scienze
Similarity:
In this paper we study generic coverings of branched over a curve s.t. the total space is a normal analytic surface, in terms of a graph representing the monodromy of the covering, called monodromy graph. A complete description of the monodromy graphs and of the local fundamental groups is found in case the branch curve is (with ) and the degree of the cover is equal to or .
Visentin, Terry I., Wieler, Susana W. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Benvenuti, Silvia (2001)
Advances in Geometry
Similarity:
Bronisław Wajnryb (1998)
Fundamenta Mathematicae
Similarity:
Let B be a 3-dimensional handlebody of genus g. Let ℳ be the group of the isotopy classes of orientation preserving homeomorphisms of B. We construct a 2-dimensional simplicial complex X, connected and simply-connected, on which ℳ acts by simplicial transformations and has only a finite number of orbits. From this action we derive an explicit finite presentation of ℳ.
Goda, Hiroshi, Teragaito, Masakazu (2005)
Algebraic & Geometric Topology
Similarity:
Hartmann, Sven, Little, C.H.C. (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Michael Henning, Christian Löwenstein (2012)
Open Mathematics
Similarity:
Let H be a hypergraph on n vertices and m edges with all edges of size at least four. The transversal number τ(H) of H is the minimum number of vertices that intersect every edge. Lai and Chang [An upper bound for the transversal numbers of 4-uniform hypergraphs, J. Combin. Theory Ser. B, 1990, 50(1), 129–133] proved that τ(H) ≤ 2(n+m)/9, while Chvátal and McDiarmid [Small transversals in hypergraphs, Combinatorica, 1992, 12(1), 19–26] proved that τ(H) ≤ (n + 2m)/6. In this paper, we...
Václav J. Havel (1994)
Archivum Mathematicum
Similarity:
We deal with two types of buildups of 3-configurations: a generating buildup over a given edge set and a regulated one (according to maximal relative degrees of vertices over a penetrable set of vertices). Then we take account to minimal generating edge sets, i.e., to edge bases. We also deduce the fundamental relation between the numbers of all vertices, of all edges from edge basis and of all terminal elements. The topic is parallel to a certain part of Belousov' “Configurations...