(Enter summary)
Abstract: . We discuss three methods of constructing surface
triangulations that do not have short noncontractible cycles (equivalently,
that have high representativity). The three methods are: the
covering spaces technique, a combinatorial method, and a method
that applies hyperbolic geometry. Using the first method we show
that for any genus g and n c 1 g log log g there exists a triangulation
of a genus g surface with an n vertex graph such that the
representativity is at least c
0
1
p
n=g
p... (Update)
Context of citations to this paper: More
.... at least 2( p n=g log 3 g) The construction leading to this result (and its further improvement to 2( p n=g p log log g) [9]) uses the covering spaces technique and does not imply an efficient algorithm. In this paper, we show a very simple combinatorial construction...
Cited by: More
A Simple Construction of High Representativity Triangulations - Przytycka, Przytycki (1993)
(Correct)
Active bibliography (related documents): More All
0.5: On Even Triangulations of 2-Connected Embedded Graphs - Zhang, He (2002)
(Correct)
0.5: Eigenmodes of Isospectral Drums - Driscoll (1995)
(Correct)
0.5: Teichmüller Spaces Are Not Starlike - Krushkal (1995)
(Correct)
Similar documents based on text: More All
0.2: Subexponentially Computable Truncations of Jones-type.. - Przytycka, Przytycki
(Correct)
0.2: Almost All Rooted Maps Have Large Representativity - Bender, Gao, Richmond (1999)
(Correct)
0.2: Computing a Canonical Polygonal Schema of an.. - Lazarus.. (2001)
(Correct)
BibTeX entry: (Update)
T.M.Przytycka, J.H.Przytycki, Surface Triangulations Without Short Noncontractible Cycles, Contemporary Mathematics, 147 (1993). http://citeseer.ist.psu.edu/przytycka93surface.html More
@misc{ przytycka93surface,
author = "T. Przytycka and J. Przytycki",
title = "Surface Triangulations Without Short Noncontractible Cycles",
text = "T.M.Przytycka, J.H.Przytycki, Surface Triangulations Without Short Noncontractible
Cycles, Contemporary Mathematics, 147 (1993).",
year = "1993",
url = "citeseer.ist.psu.edu/przytycka93surface.html" }
Citations (may not include all citations):
2003
The Art of Computer Programming (context) - Knuth - 1986
537
Graph Theory With Applications (context) - Bondy, Murty - 1976
22
Princeton University Press (context) - Hempel, Ann et al. - 1976
18
Disjoint paths on a surface (context) - Robertson, Seymour et al. - 1990
17
Regulare Graphen gegebener Taillenweite mit minimaler Knoten.. (context) - Erdos, Sachs - 1963
14
Representativity of surface embeddings (context) - Robertson, Vitray - 1990
10
Extremal Graph Theory with Emphasis on Probabilistic Methods (context) - Bollob'as - 1986
10
Coset representation in free groups (context) - Hall - 1949
7
Densely embedded graphs (context) - Archdeacon - 1992
7
Embedding of graphs with no short non-contractible cycles (context) - Thomassen - 1990
2
Riemannsche Flachen mit grosser Kragenweite (context) - Buser - 1978
2
Private communication (context) - Buser - 1988
2
Brace and World (context) - Massey, Topology et al. - 1967
2
On lower bound for short noncontractible cycles in embedded .. (context) - Przytycka, Przytycki - 1990
2
A simple construction of high representativity triangulation..
- Przytycka, Przytycki
2
On short non-contractible cycles in embedded graphs (context) - Hutchinson - 1988
1
A note on free groups (context) - Burns - 1969
1
surface triangulations (context) - McCool, communication - 1987
1
ere, A.Marin, Triangulations presque (context) - Colin - 1990
1
A First Course in Algebraic Topology (context) - Ko'sniowski - 1980
1
Finite graphs and free groups (context) - Stallings - 1985
Documents on the same site (http://grserv.med.jhmi.edu/~przytyck/): More
On the Agreement of Many Trees - Farach, Przytycka, Thorup (1995)
(Correct)
Constructing Huffman Trees in Parallel - Larmore, Przytycka (1995)
(Correct)
General Techniques for Comparing Unrooted Evolutionary.. - Kao, Lam, Przytycka.. (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC