83 research outputs found
A bijection for rooted maps on general surfaces
We extend the Marcus-Schaeffer bijection between orientable rooted bipartite
quadrangulations (equivalently: rooted maps) and orientable labeled one-face
maps to the case of all surfaces, that is orientable and non-orientable as
well. This general construction requires new ideas and is more delicate than
the special orientable case, but it carries the same information. In
particular, it leads to a uniform combinatorial interpretation of the counting
exponent for both orientable and non-orientable rooted
connected maps of Euler characteristic , and of the algebraicity of their
generating functions, similar to the one previously obtained in the orientable
case via the Marcus-Schaeffer bijection. It also shows that the renormalization
factor for distances between vertices is universal for maps on all
surfaces: the renormalized profile and radius in a uniform random pointed
bipartite quadrangulation on any fixed surface converge in distribution when
the size tends to infinity. Finally, we extend the Miermont and
Ambj{\o}rn-Budd bijections to the general setting of all surfaces. Our
construction opens the way to the study of Brownian surfaces for any compact
2-dimensional manifold.Comment: v2: 55 pages, 22 figure
Asymptotic enumeration and limit laws for graphs of fixed genus
It is shown that the number of labelled graphs with n vertices that can be
embedded in the orientable surface S_g of genus g grows asymptotically like
where , and is the exponential growth rate of planar graphs. This generalizes the
result for the planar case g=0, obtained by Gimenez and Noy.
An analogous result for non-orientable surfaces is obtained. In addition, it
is proved that several parameters of interest behave asymptotically as in the
planar case. It follows, in particular, that a random graph embeddable in S_g
has a unique 2-connected component of linear size with high probability
Two Results in Drawing Graphs on Surfaces
In this work we present results on crossing-critical graphs drawn on non-planar surfaces and results on edge-hamiltonicity of graphs on the Klein bottle. We first give an infinite family of graphs that are 2-crossing-critical on the projective plane. Using this result, we construct 2-crossing-critical graphs for each non-orientable surface. Next, we use 2-amalgamations to construct 2-crossing-critical graphs for each orientable surface other than the sphere. Finally, we contribute to the pursuit of characterizing 4-connected graphs that embed on the Klein bottle and fail to be edge-hamiltonian. We show that known 4-connected counterexamples to edge-hamiltonicity on the Klein bottle are hamiltonian and their structure allows restoration of edge-hamiltonicity with only a small change
Colouring quadrangulations of projective spaces
A graph embedded in a surface with all faces of size 4 is known as a
quadrangulation. We extend the definition of quadrangulation to higher
dimensions, and prove that any graph G which embeds as a quadrangulation in the
real projective space P^n has chromatic number n+2 or higher, unless G is
bipartite. For n=2 this was proved by Youngs [J. Graph Theory 21 (1996),
219-227]. The family of quadrangulations of projective spaces includes all
complete graphs, all Mycielski graphs, and certain graphs homomorphic to
Schrijver graphs. As a corollary, we obtain a new proof of the Lovasz-Kneser
theorem
Some Centrally Symmetric Manifolds
We show existence of centrally symmetric maps on surfaces all of whose faces
are quadrangles and pentagons for each orientable genus . We also
show existence of centrally symmetric maps on surfaces all of whose faces are
hexagons for each orientable genus , . We enumerate
centrally symmetric triangulated manifolds of dimensions 2 and 3 with few
vertices.Comment: 18 page
- …